The paper provides a preliminary study of algebraic semantics for modal and superintuitionistic non-monotonic logics. The main question answered is: how can non-monotonic inference be understood algebraically?

Current practice in logic increasingly accords recognition to abductive, presumptive or plausible arguments, in addition to deductive and inductive arguments. But there is uncertainty about what these terms exactly mean, what the differences between them are (if any), and how they relate. By examining some analyses ofthese terms and some of the history of the subject (including the views of Peirce and Cameades), this paper sets out considerations leading to a set of definitions, discusses the relationship of these three forms (...) of argument to argumentation schemes and sets out a new argumentation scheme for abductive argument. (shrink)

Interpretation is the process whereby a hearer reasons to an interpretation of a speaker's discourse. The hearer normally adopts a credulous attitude to the discourse, at least for the purposes of interpreting it. That is to say the hearer tries to accommodate the truth of all the speaker's utterances in deriving an intended model. We present a nonmonotonic logical model of this process which defines unique minimal preferred models and efficiently simulates a kind of closed-world reasoning of particular interest for (...) human cognition. Byrne's “suppression” data (Byrne, 1989) are used to illustrate how variants on this logic can capture and motivate subtly different interpretative stances which different subjects adopt, thus indicating where more fine-grained empirical data are required to understand what subjects are doing in this task. We then show that this logical competence model can be implemented in spreading activation network models. A one pass process interprets the textual input by constructing a network which then computes minimal preferred models for (3-valued) valuations of the set of propositions of the text. The neural implementation distinguishes easy forward reasoning from more complex backward reasoning in a way that may be useful in explaining directionality in human reasoning. (shrink)

ABSTRACT What characterizes human reasoning is the ability of dealing with incomplete information. Incomplete logic is developed for modeling incomplete knowledge. The most distinctive feature of incomplete logic is its semantics. This is an alternative presentation of partial semantics. In this paper, we will introduce the general notion of incomplete logic (ICL), compare it with partial logic, and give the resolution method for it. We will also show how ICL can be applied to nonmonotonic reasoning. We define nonmonotonic derivation as (...) monotonic derivation in ICL from the database and some consistent assumptions. The mechanism of ICL makes it easy to assert the consistency of an assumption without asserting the assumption itself. (shrink)

Toulmin’s scheme for the layout of arguments (1958, The Uses of Argument, Cambridge University Press, Cambridge) represents an influential tool for the analysis of arguments. The scheme enriches the traditional premises-conclusion model of arguments by distinguishing additional elements, like warrant, backing and rebuttal. The present paper contains a formal elaboration of Toulmin’s scheme, and extends it with a treatment of the formal evaluation of Toulmin-style arguments, which Toulmin did not discuss at all. Arguments are evaluated in terms of a so-called (...) dialectical interpretation of their assumptions. In such an interpretation, an argument’s assumptions can be evaluated as defeated, e.g., when there is a defeating reason against the assumption. The present work builds on recent research on defeasible argumentation (cf. e.g. the work of Pollock, Reiter, Loui, Vreeswijk, Prakken, Hage and Dung). More specifically, the author’s work on the dialectical logic DEFLOG and the argumentation tool ARGUMED serve as starting points. (shrink)

In this two-parts paper we present paranormal modal logic: a modal logic which is both paraconsistent and paracomplete. Besides using a general framework in which a wide range of logics  including normal modal logics, paranormal modal logics and classical logic can be defined and proving some key theorems about paranormal modal logic (including that it is inferentially equivalent to classical normal modal logic), we also provide a philosophical justification for the view that paranormal modal logic is a formalization of (...) the notions of skeptical and credulous plausibility. (shrink)

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, (...) considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourr6n/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step. (shrink)

In a range of contexts, one comes across processes resembling inference, but where input propositions are not in general included among outputs, and the operation is not in any way reversible. Examples arise in contexts of conditional obligations, goals, ideals, preferences, actions, and beliefs. Our purpose is to develop a theory of such input/output operations. Four are singled out: simple-minded, basic (making intelligent use of disjunctive inputs), simple-minded reusable (in which outputs may be recycled as inputs), and basic reusable. They (...) are defined semantically and characterised by derivation rules, as well as in terms of relabeling procedures and modal operators. Their behaviour is studied on both semantic and syntactic levels. (shrink)

The aim of this paper is to strengthen the point made by Horty about the relationship between reason holism and moral particularism. In the literature prima facie obligations have been considered as the only source of reason holism. I strengthen Horty’s point in two ways. First, I show that contrary-to-duties provide another independent support for reason holism. Next I outline a formal theory that is able to capture these two sources of holism. While in simple settings the proposed account coincides (...) with Horty’s one, this is not true in more complicated or “realistic” settings in which more than two norms collide. My chosen formalism is so-called input/output logic. A bottom-line example is introduced. It raises the issue of whether the conventional wisdom is right in assuming that normative reasons run parallel to epistemic ones. (shrink)

We demonstrate a heterogeneity of representation types for breast cancer phenotypes and stress that the characterisation of a tumour phenotype often includes parameters that go beyond the representation of a corresponding empirically observed tumour, thus reflecting significant functional features of the phenotypes as well as epistemic interests that drive the modes of representation. Accordingly, the represented features of cancer phenotypes function as epistemic vehicles aiding various classifications, explanations, and predictions. In order to clarify how the plurality of epistemic motivations can (...) be integrated on a formal level, we give a distinction between six categories of human agents as individuals and groups focused around particular epistemic interests. We analyse the corresponding impact of these groups and individuals on representation types, mapping and reasoning scenarios. Respecting the plurality of representations, related formalisms, expressivities and aims, as they are found across diverse scientific communities, we argue for a pluralistic ontology integration. Moreover, we discuss and illustrate to what extent such a pluralistic integration is supported by the distributed ontology language DOL, a meta-language for heterogeneous ontology representation that is currently under standardisation as ISO WD 17347 within the OntoIOp (Ontology Integration and Interoperability) activity of ISO/TC 37/SC 3. We particularly illustrate how DOL supports representations of parthood on various levels of logical expressivity, mapping of terms, merging of ontologies, as well as non-monotonic extensions based on circumscription allowing a transparent formal modelling of the normal/abnormal distinction in phenotypes. (shrink)

In this paper I argue that it is finally time to move beyond the Nagelian framework and to break new ground in thinking about epistemic reduction in biology. I will do so, not by simply repeating all the old objections that have been raised against Ernest Nagel’s classical model of theory reduction. Rather, I grant that a proponent of Nagel’s approach can handle several of these problems but that, nevertheless, Nagel’s general way of thinking about epistemic reduction in terms of (...) theories and their logical relations is entirely inadequate with respect to what is going on in actual biological research practice. (shrink)

Carneades is a recently proposed formalism for structured argumentation with varying proof standards, inspired by legal reasoning, but more generally applicable. Its distinctive feature is that each statement can be given its own proof standard, which is claimed to allow a more natural account of reasoning under burden of proof than existing formalisms for structured argumentation, in which proof standards are defined globally. In this article, the two formalisms are formally related by translating Carneades into the ASPIC+ framework for structured (...) argumentation. Since ASPIC+ is defined to generate Dung-style abstract argumentation frameworks, this in effect translates Carneades graphs into abstract argumentation frameworks. For this translation, we prove a formal correspondence and show that certain rationality postulates hold. It is furthermore proved that Carneades always induces a unique Dung extension, which is the same in all of Dung's semantics, allowing us to generalise Carneades to cycle-containing structures. (shrink)

One goal of normative multi-agent system theory is to formulate principles for normative system change that maintain the rule-like structure of norms and preserve links between norms and individual agent obligations. A central question raised by this problem is whether there is a framework for norm change that is at once specific enough to capture this rule-like behavior of norms, yet general enough to support a full battery of norm and obligation change operators. In this paper we propose an answer (...) to this question by developing a bimodal logic for norms and obligations called NO. A key to our approach is that norms are treated as propositional formulas, and we provide some independent reasons for adopting this stance. Then we define norm change operations for a wide class of modal systems, including the class of NO systems, by constructing a class of modal revision operators that satisfy all the AGM postulates for revision, and constructing a class of modal contraction operators that satisfy all the AGM postulates for contraction. More generally, our approach yields an easily extendable framework within which to work out principles for a theory of normative system change. (shrink)

Look before you leap. - Proverb. He who hesitates is lost. - Another proverb.

When someone is asked to speak his mind, it is sometimes possible for him to furnish what his utterance appears to have omitted. In such cases we might say that he had a mind to speak. Sometimes, however, the opposite is true. Asked to speak his mind, our speaker finds that he has no mind to speak. When it is possible to speak one's mind and when not is largely determined by the kinds of beings we are and by the (...) kinds of resources we are able to draw upon. In either case, not speaking one's mind is leaving something out whose articulation would or could matter for the purposes for which one was speaking in the first place. Inarticulation is no fleetingly contingent and peripheral phenomenon in human thinking and discourse. It is a substantial and dominant commonplace. In Part One I attempt to say something about what it is about the human agent that makes inarticulateness so rife. In Part Two, I consider various strategies for making the unarticulated explicit, and certain constraints on such processes. I shall suggest, among other things, that standard treatments of enthymematic reconstruction are fundamentally misconceived. (shrink)

An abstract framework for structured arguments is presented, which instantiates Dung's ('On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming, and n- Person Games', Artificial Intelligence , 77, 321-357) abstract argumentation frameworks. Arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules. This naturally leads to three ways of attacking an argument: attacking a premise, attacking a conclusion and attacking an inference. To resolve such attacks, preferences may (...) be used, which leads to three corresponding kinds of defeat: undermining, rebutting and undercutting defeats. The nature of the inference rules, the structure of the logical language on which they operate and the origin of the preferences are, apart from some basic assumptions, left unspecified. The resulting framework integrates work of Pollock, Vreeswijk and others on the structure of arguments and the nature of defeat and extends it in several respects. Various rationality postulates are proved to be satisfied by the framework, and several existing approaches are proved to be a special case of the framework, including assumption-based argumentation and DefLog. (shrink)

Nonmonotonic consequence is the subject of a vast literature, but the idea of a nonmonotonic counterpart of logical inconsistency—the idea of a defeasible property representing internal conflict of an inductive or evidential nature—has been entirely neglected. After considering and dismissing two possible analyses relating nonmonotonic consequence and a nonmonotonic counterpart of logical inconsistency, this paper offers a set of postulates for nonmonotonic inconsistency, an analysis of nonmonotonic inconsistency in terms of nonmonotonic consequence, and a series of results showing that nonmonotonic (...) inconsistency conforms to these postulates given the analysis of nonmonotonic inconsistency presented here and certain postulates for nonmonotonic consequence. The results presented here establish the interest of certain previously undiscussed postulates of nonmonotonic consequence. These results also show that nonmonotonicity, which has never seemed useful in the formulation of general principles governing nonmonotonic reasoning, is relevant to the positive characterization of nonmonotonic inference after all. (shrink)

According to one productive and influential approach to cognition, categorization, object recognition, and higher level cognitive processes operate on a set of fixed features, which are the output of lower level perceptual processes. In many situations, however, it is the higher level cognitive process being executed that influences the lower level features that are created. Rather than viewing the repertoire of features as being fixed by low-level processes, we present a theory in which people create features to subserve the representation (...) and categorization of objects. Two types of category learning should be distinguished. Fixed space category learning occurs when new categorizations are representable with the available feature set. Flexible space category learning occurs when new categorizations cannot be represented with the features available. Whether fixed or flexible, learning depends on the featural contrasts and similarities between the new category to be represented and the individual's existing concepts. Fixed feature approaches face one of two problems with tasks that call for new features: If the fixed features are fairly high level and directly useful for categorization, then they will not be flexible enough to represent all objects that might be relevant for a new task. If the fixed features are small, subsymbolic fragments (such as pixels), then regularities at the level of the functional features required to accomplish categorizations will not be captured by these primitives. We present evidence of flexible perceptual changes arising from category learning and theoretical arguments for the importance of this flexibility. We describe conditions that promote feature creation and argue against interpreting them in terms of fixed features. Finally, we discuss the implications of functional features for object categorization, conceptual development, chunking, constructive induction, and formal models of dimensionality reduction. Key Words: concept learning; conceptual development; features; perceptual learning; stimulus encoding. (shrink)

Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic.

We motivate and formalize the idea of sameness by default: two objects are considered the same if they cannot be proved to be different. This idea turns out to be useful for a number of widely different applications, including natural language processing, reasoning with incomplete information, and even philosophical paradoxes. We consider two formalizations of this notion, both of which are based on Reiter’s Default Logic. The first formalization is a new relation of indistinguishability that is introduced by default. We (...) prove that the corresponding default theory has a unique extension, in which every two objects are indistinguishable if and only if their non-equality cannot be proved from the known facts. We show that the indistinguishability relation has some desirable properties: it is reflexive, symmetric, and, while not transitive, it has a transitive “flavor.” The second formalization is an extension (modification) of the ordinary language equality by a similar default: two objects are equal if and only if their non-equality cannot be proved from the known facts. It appears to be less elegant from a formal point of view. In particular, it gives rise to multiple extensions. However, this extended equality is better suited for most of the applications discussed in this paper. (shrink)

This paper describes an approach to legal logic based on the formal analysis of argumentation schemes. Argumentation schemes a notion borrowed from the .eld of argumentation theory - are a kind of generalized rules of inference, in the sense that they express that given certain premises a particular conclusion can be drawn. However, argumentation schemes need not concern strict, abstract, necessarily valid patterns of reasoning, but can be defeasible, concrete and contingently valid, i.e., valid in certain contexts or under certain (...) circumstances. A method is presented to analyze argumentation schemes and it is shown how argumentation schemes can be embedded in a formal model of dialectical argumentation. (shrink)

Allocating the burden of proof and intuitions in philosophical disputes.– This paper criticises the view that in philosophical disputes the onus probandi rests on those who advance a position that contradicts our basic intuitions. Such a rule for allocating the burden of proof may be an adequate reconstruction of everyday justification, but is unreasonable in the area of philosophy. In philosophy it is not only difficult to determine the plausibility of a proposition, at the same time contradictory claims may be (...) equally plausible. – In contrast to such common sense proposals I try to show that in philosophical disputes the burden of proof does not depend on the material content of speech acts. A speaker simply bears the burden of proof for a proposition p if he has asserted that p and has agreed to justify it. (shrink)

We define an order independent version of default unification on typed feature structures. The operation is one where default information in a feature structure typed with a more specific type, will override default information in a feature structure typed with a more general type, where specificity is defined by the subtyping relation in the type hierarchy. The operation is also able to handle feature structures where reentrancies are default. We provide a formal semantics, prove order independence and demonstrate the utility (...) of this version of default unification in several linguistic applications. First, we show how it can be used to define multiple orthogonal default inheritance in the lexicon in a fully declarative fashion. Secondly, we show how default lexical specifications (introduced via default lexical inheritance) can be made to usefully persist beyond the lexicon and interact with syntagmatic rules. Finally, we outline how persistent default unification might underpin default feature propagation principles and a more restrictive and constraint-based approach to lexical rules. (shrink)

Synthese: An International Journal for Epistemology, Logic and Philosophy of Science, 157, 2007, 197-240. Published version available at: http://www.springerlink.com/content/q9402gv46t415504/fulltext.pdf.

A non-monotonic logic, the Logic of Plausible Reasoning (LPR), capable of coping with the demands of what we call complex reasoning, is introduced. It is argued that creative complex reasoning is the way of reasoning required in many instances of scientific thought, professional practice and common life decision taking. For managing the simultaneous consideration of multiple scenarios inherent in these activities, two new modalities, weak and strong plausibility, are introduced as part of the Logic of Plausible Deduction (LPD), a deductive (...) logic specially designed to serve as the monotonic support for LPR. Axiomatics and semantics for LPD, together with a completeness proof, are provided. Once LPD has been given, LPR may be defined via a concept of extension over LPD. Although the construction of LPR extensions is first presented in standard style, for the sake of comparison with existing non-monotonic formalisms, alternative more elegant and intuitive ways for constructing non-monotonic LPR extensions are also given and proofs of their equivalence are presented. (shrink)

It is often assumed that cognitive science is built upon folk psychology, and that challenges to folk psychology are therefore challenges to cognitive science itself. We argue that, in practice, cognitive science and folk psychology treat entirely non-overlapping domains: cognitive science considers aspects of mental life which do not depend on general knowledge, whereas folk psychology considers aspects of mental life which do depend on general knowledge. We back up our argument on theoretical grounds, and also illustrate the separation between (...) cognitive scientific and folk psychological phenomena in a number of cognitive domains. We consider the methodological and theoretical significance of our arguments for cognitive science research. (shrink)

Rational analysis (Anderson 1990, 1991a) is an empiricalprogram of attempting to explain why the cognitive system isadaptive, with respect to its goals and the structure of itsenvironment. We argue that rational analysis has two importantimplications for philosophical debate concerning rationality. First,rational analysis provides a model for the relationship betweenformal principles of rationality (such as probability or decisiontheory) and everyday rationality, in the sense of successfulthought and action in daily life. Second, applying the program ofrational analysis to research on human reasoning (...) leads to a radicalreinterpretation of empirical results which are typically viewed asdemonstrating human irrationality. (shrink)

I analyze the frame problem and its relation to other epistemological problems for artificial intelligence, such as the problem of induction, the qualification problem and the "general" AI problem. I dispute the claim that extensions to logic (default logic and circumscriptive logic) will ever offer a viable way out of the problem. In the discussion it will become clear that the original frame problem is really a fairy tale: as originally presented, and as tools for its solution are circumscribed by (...) Pat Hayes, the problem is entertaining, but incapable of resolution. The solution to the frame problem becomes available, and even apparent, when we remove artificial restrictions on its treatment and understand the interrelation between the frame problem and the many other problems for artificial epistemology. I present the solution to the frame problem: an adequate theory and method for the machine induction of causal structure. Whereas this solution is clearly satisfactory in principle, and in practice real progress has been made in recent years in its application, its ultimate implementation is in prospect only for future generations of AI researchers. (shrink)

This paper discusses some key connexive principles construed as principles about reasons, that is, as principles that express logical properties of sentences of the form ‘p is a reason for q’. Its main goal is to show how the theory of reasons outlined by Crupi and Iacona, which is based on their evidential account of conditionals, yields a formal treatment of such sentences that validates a restricted version of the principles discussed, overcoming some limitations that affect most extant accounts of (...) conditionals. (shrink)

Around the world, private and public organizations use software called legal expert systems to compute taxes. This software must comply with the laws they are designed to implement. As such, a bug or an error in a program that leads to tax miscalculations can have heavy legal and democratic consequences. However, increasing evidence suggests that some legal expert systems may not comply with the law. Moreover, traditional software development processes mean that legal expert systems are difficult to adapt to the (...) continuous flow of new legislation. To prevent further software decay and to reconcile these systems with the growing demand for algorithmic transparency, we argue that there is a need for a new development process for legal expert systems. This new system must be built to comply with the law, in particular the GDPR. It must also respect democratic transparency. For these reasons, we present a solution built by lawyers and computer scientists: C atala, a new programming language coupled with a pair programming development process. (shrink)

Abstract: The article presents and critically discusses Walton's (and Reed's and Macagno's) argument scheme approach to a theory of good argumentation. In particular, four characteristics of Walton's approach are presented: 1. It presents normative requirements for argumentation in the form of argument schemes, i.e. relatively concrete type descriptions. 2. These schemata are enthymematic, i.e. they omit some of the premises required by other approaches. 3. The actual argument schemes are usually supplemented by critical questions. 4. The method is inductive, bottom-up, (...) gaining the normative schemata by abstraction from empirically collected groups of similar arguments. These characteristics, among others, are then discussed on the basis of four adequacy conditions: AC1: effectiveness in achieving the epistemic goal of obtaining and communicating justified acceptable opinions; AC2: completeness in capturing the good argument types; AC3: efficiency in achieving the goals; AC4: justification of the argument schemes. The discussion then reveals a number of weaknesses in Walton's argument schemes; among other things, they are neither effective (in the defined sense) nor truly justified. Contributing factors to these problems include the schema approach, i.e. not looking at the form of arguments, and the lack of epistemological foundations in the development of good types of arguments. However, the critical analyses reveal a better alternative: an epistemological approach based on epistemological principles. The article concludes with a detailed analysis of the scheme Practical Inference, which confirms the general criticism in detail. (shrink)

J. Anthony Blair is a prominent international figure in argumentation studies. He is among the originators of informal logic, an author of textbooks on the informal logic approach to argument analysis and evaluation and on critical thinking, and a founder and editor of the journal Informal Logic. Blair is widely recognized among the leaders in the field for contributing formative ideas to the argumentation literature of the last few decades. This selection of key works provides insights into the history of (...) the field of argumentation theory and various related disciplines. It illuminates the central debates and presents core ideas in four main areas: Critical Thinking, Informal Logic, Argument Theory and Logic, Dialectic and Rhetoric. (shrink)

Conciliatory views of disagreement say, roughly, that it’s rational for you to become less confident in your take on an issue in case you find out that an epistemic peer’s take on it is the opposite. Their intuitive appeal notwithstanding, there are well-known worries about the behavior of conciliatory views in scenarios involving higher-order disagreements, which include disagreements over these views themselves and disagreements over the peer status of alleged epistemic peers. This paper does two things. First, it explains how (...) the core idea behind conciliatory views can be expressed in a defeasible logic framework. The result is a formal model that’s particularly useful for thinking about the behavior of conciliatory views in cases involving higher-order disagreements. And second, the paper uses this model to resolve three paradoxes associated with disagreements over epistemic peerhood. (shrink)

Can it ever be rational to revise one's own logic by one's own lights? In this paper I argue that logic is never rationally revisable, even if one's own logic gives rise to paradoxes and allows one to derive any conclusion whatsoever. Instead of revising logic, we need to revise a certain widely held position in the philosophy of logic, one tied to the standard conception of validity and to the alleged monotonicity of deductive reasoning. I develop the alternative conception (...) of validity and of deductive reasoning, which explains why we are generally entitled to the conclusions of deductive reasoning, even though we rationally do not accept them in certain circumstances tied to paradoxes. (shrink)