Legal systems often rule that people own objects in their territory. We propose that an early-developing ability to make territory-based inferences of ownership helps children address informational demands presented by ownership. Across 6 experiments (N = 504), we show that these inferences develop between ages 3 and 5 and stem from two aspects of the psychology of ownership. First, we find that a basic ability to infer that people own objects in their territory is already present at age (...) 3 (Experiment 1). Children even make these inferences when the territory owner unintentionally acquired the objects and was unaware of them (Experiments 2 and 3). Second, we find that between ages 3 and 5, children come to consider past events in these judgments. They move from solely considering the current location of an object in territory-based inferences, to also considering and possibly inferring where it originated (Experiments 4 to 6). Together, these findings suggest that territory-based inferences of ownership are unlikely to be constructions of the law. Instead, they may reflect basic intuitions about ownership that operate from early in development. (shrink)

Legal contracts and litigation documents common to the American legal system were encoded in the eXtensible Markup Language (XML). XML also represents rules about the contracts and litigation procedure. In addition to an expert system tool that allows one to make inferences with that engine, a Graphical User Interface (GUI) generates the XML representing the rules. A rulebase is developed by marking up examples of the XML to be interpreted and the XML to be generated, analogously to Query By Example. (...) This article provides a broader context of the synergy between XML and artificial intelligence by including discussions of: (1) the role of Artificial Intelligence in handling routine litigation; (2) how the use of XML enables legal expert systems to get their `input' without the user having to enter the same information again for the expert system;(3) the advantages of XML markup over other forms of markup for documents; (4) the relationship between XML and ontologies; (5) other projects using XML with rules or legal affairs. (shrink)

Decision-makers in governments, enterprises, businesses and agencies or individuals, typically, make decisions according to various regulations, guidelines and policies based on existing records stored in various databases, in particular, relational databases. To assist decision-makers, an expert system, encompasses interactive computer-based systems or subsystems to support the decision-making process. Typically, most expert systems are built on top of transaction systems, databases, and data models and restricted in decision-making to the analysis, processing and presenting data and information, and they do (...) not provide support for the normative layer. This paper will provide a solution to one specific problem that arises from this situation, namely the lack of tool/mechanism to demonstrate how an expert system is well-suited for supporting decision-making activities drawn from existing records and relevant legal requirements aligned existing records stored in various databases.We present a Rule-based reporting systems architecture, which is intended to integrate databases, in particular, relational databases, with a logic-based reasoner and rule engine to assist in decision-making or create reports according to legal norms. We argue that the resulting RuleRS provides an efficient and flexible solution to the problem at hand using defeasible inference. To this end, we have also conducted empirical evaluations of RuleRS performance. (shrink)

Condensed detachment is usually regarded as a notation, and defined by example. In this paper it is regarded as a rule of inference, and rigorously defined with the help of the Unification Theorem of J. A. Robinson. Historically, however, the invention of condensed detachment by C. A. Meredith preceded Robinson's studies of unification. It is argued that Meredith's ideas deserve recognition in the history of unification, and the possibility that Meredith was influenced, through ukasiewicz, by ideas of Tarski (...) going back at least to 1939, and possibly to 1930 or earlier, is discussed. It is proved that a term is derivable by substitution and ordinary detachment from given axioms if and only if it is a substitution instance of a term which is derivable from these axioms by condensed detachment, and it is shown how this theorem enables the ideas of ukasiewicz and Tarski mentioned above to be formalized and extended. Finally, it is shown how condensed detachment may be subsumed within the resolution principle of J. A. Robinson, and several computer studies of particular Hilbert-type propositional calculi using programs based on condensed detachment or on resolution are briefly discussed. (shrink)

Elizabeth Karger has suggested an interpretation of Ockham's theory of the modes of common personal supposition ("TM") according to which the purpose of TM is to provide certain distinctions that Ockham will use in formulating a unified theory of immediate inference among certain kinds of sentences. Karger presents a single, powerful rule of inference that incorporates TM distinctions and that is meant to codify Ockham's theory of immediate inference. I raise an objection to Karger's rule, (...) thereby calling into doubt the interpretation of Ockham that is based on attributing that rule to him. (shrink)

Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief revision (...) for agents which reason in a simpler logic than full first-order logic, namely rule-based reasoners. We show that it is possible to define a contraction operation for rule-based reasoners, which we call McAllester contraction, which satisfies all the basic Alchourrón, Gärdenfors and Makinson (AGM) postulates for contraction (apart from the recovery postulate) and at the same time can be computed in polynomial time. We prove a representation theorem for McAllester contraction with respect to the basic AGM postulates (minus recovery), and two additional postulates. We then show that our contraction operation removes a set of beliefs which is least preferred, with respect to a natural interpretation of preference. Finally, we show how McAllester contraction can be used to define a revision operation which is also polynomial time, and prove a representation theorem for the revision operation. (shrink)

A syntactic machinery is developed for π-institutions based on the notion of a category of natural transformations on their sentence functors. Rules of inference, similar to the ones traditionally used in the sentential logic framework to define the best known sentential logics, are, then, introduced for π-institutions. A π-institution is said to be rule-based if its closure system is induced by a collection of rules of inference. A logical matrix-like semantics is introduced for rule- (...) class='Hi'>based π-institutions and a version of Bloom's Lemma and Bloom's Theorem are proved for rule-based π-institutions. (shrink)

The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is (...) basically self-contained and special attention has been made to present the material in a convenient manner for the reader. Proofs of results, many of which are not readily available elsewhere, are also included. The book is written at a level appropriate for first-year graduate students in mathematics or computer science. Although some knowledge of elementary logic and universal algebra are necessary, the first chapter includes all the results from universal algebra and logic that the reader needs. For graduate students in mathematics and computer science the book is an excellent textbook. (shrink)

Researchers currently working on relational reasoning typically argue that mental model theory (MMT) is a better account than the inference rule approach (IRA). They predict and observe that determinate (or one-model) problems are easier than indeterminate (or two-model) problems, whereas according to them, IRA should lead to the opposite prediction. However, the predictions attributed to IRA are based on a mistaken argument. The IRA is generally presented in such a way that inference rules only deal with (...) determinate relations and not with indeterminate ones. However, (a) there is no reason to presuppose that a rule-based procedure could not deal with indeterminate relations, and (b) applying a rule-based procedure to indeterminate relations should result in greater difficulty. Hence, none of the recent articles devoted to relational reasoning currently presents a conclusive case for discarding IRA by using the well-known determinate vs indeterminate problems comparison. (shrink)

In the natural deduction system for classical propositional logic given by G. Gentzen, there are some inference rules with assumptions discharged by the rule. D. Prawitz calls such inference rules improper as opposed to proper ones. Improper inference rules are more complicated than proper ones and more difficult to understand. In 2022, we provided a sequent system based solely on the application of proper rules. In the present paper, on the basis of our system from (...) 2022, we classify improper inference rules. (shrink)

Much evidence has accumulated in favor of such a dual view of reasoning. There is however some vagueness in the way the two systems are characterized. Instead of a principled distinction, we are presented with a bundle of contrasting features - slow/fast, automatic/controlled, explicit/implicit, associationist/rule based, modular/central - that, depending on the specific dual process theory, are attributed more or less exclusively to one of the two systems. As Evans states in a recent review, “it would then be (...) helpful to have some clear basis for this distinction”; he also suggests that “we might be better off talking about type 1 and type 2 processes” rather than systems. We share the intuitions that drove the development of dual system theories. Our goal here is to propose in the same spirit a principled distinction between two types of inferences: ‘intuitive inference’ and ‘reflective inference’. We ground this distinction in a massively modular view of the human mind where metarepresentational modules play an important role in explaining the peculiarities of human psychological evolution. We defend the hypothesis that the main function of reflective inference is to produce and evaluate arguments occurring in interpersonal communication. This function, we claim, helps explain important aspects of reasoning. We review some of the existing evidence and argue that it gives support to this approach. (shrink)

The performance of symbolic inference tasks has long been a challenge to connectionists. In this paper, we present an extended survey of this area. Existing connectionist inference systems are reviewed, with particular reference to how they perform variable binding and rule- based reasoning and whether they involve distributed or localist representations. The bene®ts and disadvantages of different representations and systems are outlined, and conclusions drawn regarding the capabilities of connectionist inference systems when compared with symbolic (...) inference systems or when used for cognitive modelling. q 2001 Elsevier Science Ltd. All rights reserved. (shrink)

The logic of single-conclusion proofs () is introduced. It combines the verification property of proofs with the single valuedness of proof predicate and describes the operations on proofs induced by modus ponens rule and proof checking. It is proved that is decidable, sound and complete with respect to arithmetical proof interpretations based on single-valued proof predicates. The application to arithmetical inference rules specification and -admissibility testing is considered. We show that the provability in gives the complete admissibility (...) test for the rules which can be specified by schemes in -language. The test is supplied with the ground proof extraction algorithm which eliminates the admissible rules from a -proof by utilizing the information from the corresponding -proofs. (shrink)

In our thought, we employ rules of inference and belief-forming methods more generally. For instance, we (plausibly) employ deductive rules such as Modus Ponens, ampliative rules such as Inference to the Best Explanation, and perceptual methods that tell us to believe what perceptually appears to be the case. What explains our entitlement to employ these rules and methods? This chapter considers the motivations for broadly internalist answers to this question. It considers three such motivations—one based on simple (...) cases, one based on a general conception of epistemic responsibility, and one based on skeptical scenarios. The chapter argues that none of these motivations is successful. The first two motivations lead to forms of internalism—Extreme Method Internalism and Defense Internalism—that are too strong to be tenable. The third motivation motivates Mental Internalism (Mentalism), which does not fit with plausible accounts of entitlement. (shrink)

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, (...) KT , K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

In a legal expert system based on CBR (Case-Based Reasoning), legal statute rules are interpreted on the basis of precedents. This interpretation, because of its vagueness and uncertainty of the interpretation cannot be handled with the means used for crisp cases. In our legal expert system, on the basis of the facts of precedents, the statute rule is interpreted as a form of case rule, the application of which involves the concepts of membership and vagueness. The (...) case rule is stored in a data base by means of fuzzy frames. The inference based on a case rule is made by fuzzy YES and fuzzy NO, and the degree of similarity of cases. The system proposed here will be used for legal education; its main area of application is contract, especially in relation to the United Nations Convention on Contracts for the International Sale of Goods (CISG). (shrink)

Gilboa and Schmeidler provide a paradigm for modelling decision making under uncertainty. Unlike the classical theory of expected utility maximization, case-based decision theory does not assume that decision makers know the possible 'states of the world' or the outcomes, let alone the decision matrix attaching outcomes to act-state pairs. Case-based decision theory suggests that people make decisions by analogies to past cases: they tend to choose acts that performed well in the past in similar situations, and to avoid (...) acts that performed poorly. It is an alternative to expected utility theory when both states of the world and probabilities are neither given in the problem nor can be easily constructed. The authors describe the general theory and its relationship to planning, repeated choice problems, inductive inference, and learning; they highlight its mathematical and philosophical foundations and compare it with expected utility theory as well as with rule-based systems. (shrink)

In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems |$K$|⁠, |$KT$|⁠, (...) |$K4$| and |$S4$|⁠, with |$\square $| as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between |$\square $| and a natural presentation of |$\lozenge $|⁠. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

One important distinction in psychology is between inferences based on associative memory and inferences based on analysis and rules. Much previous empirical work conceive of associative and analytical processes as two exclusive ways of addressing a judgment task, where only one process is selected and engaged at a time, in an either-or fashion. However, related work indicate that the processes are better understood as being in interplay and simultaneously engaged. Based on computational modeling and brain imaging of (...) spontaneously adopted judgment strategies together with analyses of brain activity elicited in tasks where participants were explicitly instructed to perform similarity-based associative judgments or rule-based judgments (n = 74), we identified brain regions related to the two types of processes. We observed considerable overlap in activity patterns. The precuneus was activated for both types of judgments, and its activity predicted how well a similarity-based model fit the judgments. Activity in the superior frontal gyrus predicted the fit of a rule-based judgment model. The results suggest the precuneus as a key node for similarity-based judgments, engaged both when overt responses are guided by similarity-based and rule-based processes. These results are interpreted such that similarity-based processes are engaged in parallel to rule-based-processes, a finding with direct implications for cognitive theories of judgment. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti's conditional event, B|A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate (...) how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities which, given some logical dependencies, may reduce to conditional events. We show how the inference to B|A from A and B can be extended to compounds and iterations of both conditional events and biconditional events. Moreover, we determine the respective uncertainty propagation rules. Finally, we make some comments on extending our analysis to counterfactuals. (shrink)

In this paper, the traditional view that argumentum ad ignorantiam is a logical fallacy is challenged, and lessons are drawn on how to model inferences drawn from knowledge in combination with ones drawn from lack of knowledge. Five defeasible rules for evaluating knowledge-based arguments that apply to inferences drawn under conditions of lack of knowledge are formulated. They are the veridicality rule, the consistency of knowledge rule, the closure of knowledge rule, the rule of refutation (...) and the rule for argument from ignorance. The basic thesis of the paper is that knowledge-based arguments, including the argument from ignorance, need to be evaluated by criteria for epistemic closure and other evidential rules that are pragmatic in nature, that need to be formulated and applied differently at different stages of an investigation or discussion. The paper helps us to understand practical criteria that should be used to evaluate all arguments based on knowledge and/or ignorance. (shrink)

I examine and resolve an exegetical dichotomy between two main interpretations of Peirce’s theory of abduction, namely, the Generative Interpretation and the Pursuitworthiness Interpretation. According to the former, abduction is the instinctive process of generating explanatory hypotheses through a mental faculty called insight. According to the latter, abduction is a rule-governed procedure for determining the relative pursuitworthiness of available hypotheses and adopting the worthiest one for further investigation—such as empirical tests—based on economic considerations. It is shown that the (...) Generative Interpretation is inconsistent with a fundamental fact of logic for Peirce—i.e., abduction is a kind of inference—and the Pursuitworthiness Interpretation is flawed and inconsistent with Peirce’s naturalistic explanation for the possibility of science and his view about the limitations of classical scientific method. Changing the exegetical locus classicus from the logical form of abduction to insight and economy of research, I argue for the Unified Interpretation according to which abduction includes both instinctive hypotheses-generation and rule-governed hypotheses-ranking. I show that the Unified Interpretation is immune to the objections raised successfully against the Generative and the Pursuitworthiness interpretations. (shrink)

: According to a traditional view, inferences are personal-level entities pertaining to the domain of reasons, and therefore they cannot be accounted for in causal terms – specifically, as mere associations. I intend to argue that this is at the very least a drastic simplification, for two reasons. First, the word “association” is polysemous, so we should specify in which of its possible senses an inference is not a mere association. Second, personal-level inferences based on formal rules are (...) only the extreme end of a complex developmental trajectory. As the last decades of research in the field have shown, we should refrain from identifying the entire domain of reasoning with that final stage, which is in fact mostly contingent upon extensive logical training. In this paper, I try to disentangle some major stages in the development of full-fledged inferences, and then to show that all of them – till the final one – can be considered associative in appropriate senses of the word. Keywords: Reasoning; Association; Consciousness; Inference; Development Un approccio associativo alle inferenze: l’evoluzione verso il prototipo Riassunto: Secondo una concezione tradizionale, le inferenze sono entità collocate al livello della persona e appartenenti al dominio delle ragioni, e pertanto non è possibile ridurle a un resoconto causale – più specificamente, a mere associazioni. Intendo sostenere che questa è quanto meno una drastica semplificazione, per due ragioni. Primo, la parola “associazione” è polisemica, quindi dovremmo precisare in quale senso un’inferenza non è una mera associazione. Secondo, inferenze al livello della persona e basate su regole formali sono solo il punto estremo di una complessa traiettoria di sviluppo. Come gli ultimi decenni di ricerca in questo campo hanno mostrato, dovremmo evitare di identificare l’intero dominio del ragionamento con questo stadio finale, che di fatto dipende da un esteso addestramento logico. In questo articolo, provo a discriminare alcuni stadi essenziali nello sviluppo delle inferenze in senso pieno, e quindi a mostrare che ciascuno di essi – incluso quello finale – possono essere considerati associativi in qualche opportuno senso della parola. Parole chiave: Ragionamento; Associazione; Coscienza; Inferenza; Sviluppo. (shrink)

When people learn normative systems, they do so based on limited evidence. Many of the possible actions that are available to an agent have never been explicitly permitted or prohibited. But people will often need to figure out whether those unspecified actions are permitted or prohibited. How does a learner resolve this incompleteness? The learner might assume if an action-type is not expressly forbidden, then acts of that type are permitted. This closure principle is one of Liberty. Alternatively, the (...) learner might assume that if an action-type is not expressly permitted, then acts of that type are prohibited. This closure principle would be one of Residual Prohibition (Mikhail, 2011). On the basis of principles of pedagogical sampling (e.g., Shafto, Goodman, & Griffiths, 2014), we predicted that participants would infer the Liberty Principle (LP) when trained on prohibitions, and they would infer the Residual Prohibition Principle when trained on permissions. This is exactly what we found across several experiments. We also found a bias in favor of Liberty insofar as participants trained on both a prohibition and a permission rule tended still to infer the LP. However, we also found that if an action is potentially harmful, this diminishes the tendency to infer the LP. (shrink)

The logic $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ was introduced in Robles and Mendéz as a paraconsistent logic which is based on Gödel’s 3-valued matrix, except that Kleene–Łukasiewicz’s negation is added to the language and is used as the main negation connective. We show that $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ is exactly the intersection of $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ and $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$, the two truth-preserving 3-valued logics which are based on the same truth tables. We then construct a Hilbert-type system which has for $\to $ as its sole rule of (...) inference, and is strongly sound and complete for $G3^{<}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$. Then we show how, by adding one axiom or one new rule of inference, we get strongly sound and complete systems for $G3^{\{1\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$ and $G3^{\{1,0.5\}}_{{{}^{\scriptsize{-}}}\!\!\textrm{L}}$. Finally, we provide quasi-canonical Gentzen-type systems which are sound and complete for those logics and show that they are all analytic, by proving the cut-elimination theorem for them. (shrink)

In this paper we address the modelling of reasoning processes in natural agents. We focus on a very basic kind of non-monotonic inference for which we identify a simple and plausible underlying process, and we develop a family of logical models that allow to match this process. Partial worlds models, as we call them, are a variant of Kraus, Lehmann and Magidor’s cumulative models. We show that the inference relations they induce form a strict subclass of cumulative relations (...) and tackle the issue of providing sound and complete sets of rules to characterise them. Taking inspiration from the work of Gabbay and Schlechta, we analyse the question in terms of definable sets of partial worlds and conclude that completeness is probably unreachable using a standard propositional language. This brings us to enrich our language with an additional connective, which makes it possible to distinguish between two kinds of disjunction in the partial worlds context. Within this renewed framework, we provide two representation theorems: one for inference relations induced by precisification-free smooth models, and the other for inference relations induced by precisification-free ranked models. Finally we give an aperçu of how partial worlds models lend themselves to the modelling of learning. (shrink)

While most theoreticians of meaning in the first half of the twentieth century subscribed to a representational theory (viewing meanings as entities stood for by the expressions), the second half of the century was marked by the rise of various versions of use-theories of meaning. The roots of this ‘pragmatist turn’ are detectable in the writings of the later Wittgenstein, the Oxford speech act theorists (Austin, Grice) and the American neopragmatists (Quine, Sellars). Though it is now rather popular (and sometimes (...) even fashionable) to invoke the use-theory of meaning, it is by far not so popular to inquire what such a theory really is. In this paper we try to give at least a part of the answer, whereby we find out that the usual conception of such a theory is unsatisfactory. We propose that for an improvement we must, together with Wittgenstein and Sellars, conceive language as a (tool of a) rule-based activity, which enables us to replace the concept of disposition, usually constituting the backbone of the use-theory, by the concept of propriety. The resulting normative version of the use-theory then becomes the investigation of the rules which expressions acquire vis-`a-vis the rules of the relevant language games – especially of the rules of inference. (shrink)

Intuitionistic sentential logic is shown to be sound and complete with respect to a semantics centered around extensions of atomic bases (i.e. sets of inference rules for atomic sentences). The result is made possible through a non-standard interpretation of disjunction, whereby, roughly speaking, a disjunction is taken to hold just in case every atomic sentence that follows from each of the disjuncts separately holds; it is argued that this interpretation makes good sense provided that rules in atomic bases are (...) conceived of as being accepted hypothetically rather than categorically. (shrink)

The main objective of this paper is to sketch unifying conceptual and formal framework for inference that is able to explain various proof techniques without implicitly changing the underlying notion of inference rules. We base this framework upon the so-called two-dimensional, i.e., deduction to deduction, account of inference introduced by Tichý in his seminal work The Foundation’s of Frege’s Logic (1988). Consequently, it will be argued that sequent calculus provides suitable basis for such general concept of (...) class='Hi'>inference and therefore should not be seen just as technical tool, but philosophically well-founded system that can rival natural deduction in terms of its “naturalness”. (shrink)

Bayesian inference is limited in scope because it cannot be applied in idealized contexts where none of the hypotheses under consideration is true and because it is committed to always using the likelihood as a measure of evidential favouring, even when that is inappropriate. The purpose of this article is to study inductive inference in a very general setting where finding the truth is not necessarily the goal and where the measure of evidential favouring is not necessarily the (...) likelihood. I use an accuracy argument to argue for probabilism and I develop a new kind of argument to argue for two general updating rules, both of which are reasonable in different contexts. One of the updating rules has standard Bayesian updating, Bissiri et al.’s general Bayesian updating, Douven’s IBE-based updating, and Vassend’s ]) quasi-Bayesian updating as special cases. The other updating rule is novel. (shrink)

A unified and modular falsification-aware single-succedent Gentzen-style framework is introduced for classical, paradefinite, paraconsistent, and paracomplete logics. This framework is composed of two special inference rules, referred to as the rules of explosion and excluded middle, which correspond to the principle of explosion and the law of excluded middle, respectively. Similar to the cut rule in Gentzen’s LK for classical logic, these rules are admissible in cut-free LK. A falsification-aware single-succedent Gentzen-style sequent calculus fsCL for classical logic is (...) formalized based on the proposed framework. The calculus fsCL is obtained from the existing falsification-aware single-succedent Gentzen-style sequent calculus GN4 for Nelson’s paradefinite (or paraconsistent) four-valued logic N4 by adding the rules of explosion and excluded middle. A falsification-aware single-succedent Gentzen-style sequent calculus GN3 for Nelson’s paracomplete three-valued logic N3 is also obtained from GN4 by adding the rule of explosion. The cut-elimination theorems for fsCL, GN3, and some of their neighbors as well as the Glivenko theorem for fsCL are proved. (shrink)

Methods for performing complex probabilistic reasoning tasks, often based on masses of different forms of evidence obtained from a variety of different sources, are being sought by, and developed for, persons in many important contexts including law, medical diagnosis, and intelligence analysis. The complexity of these tasks can often be captured and represented by graphical structures now called inference networks. These networks are directed acyclic graphs, consisting of nodes, representing relevant hypotheses, items of evidence, and unobserved variables, and (...) arcs joining some of the nodes, representing dependency relations among them. This chapter describes and comments on two different approaches to inference network construction. In the first approach, a DAG network structure is explicitly constructed as a vehicle for probabilistic analyses. Since the associated computations can be regarded as generalising the use of Bayes' rule, such networks are commonly called Bayesian networks. The second approach stems from the work of the American jurist John H. Wigmore who was the very first person to attempt a systematic study of inference networks. (shrink)

Morality is the effort to guide one’s conduct by reasons, that is, to do what there are the best reasons for doing. From a cognitive perspective, there are many types of moral hypotheses that provide good reasons in practical and moral deliberation and action. They can take the form of principles, rules, prototypes, previous analogical cases, examples, images, feelings, metaphors, narratives, and so on. I will address the central problems of the logical structure of reasons and of inferring reasons taking (...) advantage of the fundamental distinction, suggested by Searle, between internal and external reasons. What, then, is the role of internal reasons? The answer is that they serve, in a certain way, to mediate between external and internal obligations by connecting them both logically and causally in practical and moral cognition and illustrating the relative importance of abductive cognition. Internal reasons might be based on a desire or an intention, for instance, while external reasons may be grounded in external obligations and duties that we may recognize as such. (shrink)

The principle of maximum entropy is a method for assigning values to probability distributions on the basis of partial information. In usual formulations of this and related methods of inference one assumes that this partial information takes the form of a constraint on allowed probability distributions. In practical applications, however, the information consists of empirical data. A constraint rule is then employed to construct constraints on probability distributions out of these data. Usually one adopts the rule that (...) equates the expectation values of certain functions with their empirical averages. There are, however, various other ways in which one can construct constraints from empirical data, which makes the maximum entropy principle lead to very different probability assignments. This paper shows that an argument by Jaynes to justify the usual constraint rule is unsatisfactory and investigates several alternative choices. The choice of a constraint rule is also shown to be of crucial importance to the debate on the question whether there is a conflict between the methods of inference based on maximum entropy and Bayesian conditionalization. (shrink)

This thesis proposes that an account of first-person reference and first-person thinking requires an account of practical knowledge. At a minimum, first-person reference requires at least a capacity for knowledge of the intentional act of reference. More typically, first-person reasoning requires deliberation and the ability to draw inferences while entertaining different 'I' thoughts. Other accounts of first-person reference--such as the perceptual account and the rule-based account--are criticized as inadequate. An account of practical knowledge is provided by an interpretation (...) of GEM Anscombe's account in her landmark monograph "Intention". (shrink)

Few automated legal reasoning systems have been developed in domains of law in which a judicial decision maker has extensive discretion in the exercise of his or her powers. Discretionary domains challenge existing artificial intelligence paradigms because models of judicial reasoning are difficult, if not impossible to specify. We argue that judicial discretion adds to the characterisation of law as open textured in a way which has not been addressed by artificial intelligence and law researchers in depth. We demonstrate that (...) systems for reasoning with this form of open texture can be built by integrating rule sets with neural networks trained with data collected from standard past cases. The obstacles to this approach include difficulties in generating explanations once conclusions have been inferred, difficulties associated with the collection of sufficient data from past cases and difficulties associated with integrating two vastly different paradigms. A knowledge representation scheme based on the structure of arguments proposed by Toulmin has been used to overcome these obstacles. The system, known as Split Up, predicts judicial decisions in property proceedings within family law in Australia. Predictions from the system have been compared to those from a group of lawyers with favourable results. (shrink)

We show that if an agent reasons according to standard inference rules, the truth and introspection axioms extend from the set of non-epistemic propositions to the whole set of propositions. This implies that the usual axiomatization of partitional possibility correspondences is redundant, and provides a justification for truth and introspection that is partly based on reasoning.

This article demonstrates the potential of using hierarchical Bayesian methods to relate models and data in the cognitive sciences. This is done using a worked example that considers an existing model of category representation, the Varying Abstraction Model (VAM), which attempts to infer the representations people use from their behavior in category learning tasks. The VAM allows for a wide variety of category representations to be inferred, but this article shows how a hierarchical Bayesian analysis can provide a unifying explanation (...) of the representational possibilities using 2 parameters. One parameter controls the emphasis on abstraction in category representations, and the other controls the emphasis on similarity. Using 30 previously published data sets, this work shows how inferences about these parameters, and about the category representations they generate, can be used to evaluate data in terms of the ongoing exemplar versus prototype and similarity versus rules debates in the literature. Using this concrete example, this article emphasizes the advantages of hierarchical Bayesian models in converting model selection problems to parameter estimation problems, and providing one way of specifying theoretically based priors for competing models. (shrink)

The present PhD thesis is concerned with the question whether good reasoning requires that the subject has some cognitive grip on the relation between premises and conclusion. One consideration in favor of such a requirement goes as follows: In order for my belief-formation to be an instance of reasoning, and not merely a causally related sequence of beliefs, the process must be guided by my endorsement of a rule of reasoning. Therefore I must have justified beliefs about the relation (...) between my premises and my conclusion. -/- The rationality of a belief often depends on whether it is rightly connected to other beliefs, or more generally to other mental states —the states capable of providing a reason to holding the belief in question. For instance, some rational beliefs are connected to other beliefs by being inferred from them. It is often accepted that the connection implies that the subject in some sense ‘takes the mental states in question to be reason-providing’. But views on how exactly this is to be understood differ widely. They range from interpretations according to which ‘taking a mental state to be reason-providing’ imposes a mere causal sustaining relation between belief and reason-providing state to interpretations according to which one ‘takes a mental state to be reason-providing’ only if one believes that the state is reason-providing. The most common worry about the latter view is that it faces a vicious regress. In this thesis a different but in some respects similar interpretation of ‘taking something as reason-providing’ is given. It is argued to consist of a disposition to react in certain ways to information that challenges the reason-providing capacity of the allegedly reason-providing state. For instance, that one has inferred A from B partly consists in being disposed to suspend judgment about A if one obtains a reason to believe that B does not render A probable. The account is defended against regress-objections and the suspicion of explanatory circularity. (shrink)

Research on facial emotion expression has mostly focused on emotion recognition, assuming that a small number of discrete emotions is elicited and expressed via prototypical facial muscle configurations as captured in still photographs. These are expected to be recognized by observers, presumably via template matching. In contrast, appraisal theories of emotion propose a more dynamic approach, suggesting that specific elements of facial expressions are directly produced by the result of certain appraisals and predicting the facial patterns to be expected for (...) certain appraisal configurations. This approach has recently been extended to emotion perception, claiming that observers first infer individual appraisals and only then make categorical emotion judgments based on the estimated appraisal patterns, using semantic inference rules. Here we report two related studies to empirically investigate the facial action unit configurations that are used by actors to convey specific emotions in short affect bursts and to examine to what extent observers can infer a person’s emotions from the predicted facial expression configurations. The results show that 1) professional actors use many of the predicted facial action unit patterns to enact systematically specified appraisal outcomes in a realistic scenario setting, and 2) naïve observers infer the respective emotions based on highly similar facial movement configurations with a degree of accuracy comparable to earlier research findings. Based on estimates of underlying appraisal criteria for the different emotions we conclude that the patterns of facial action units identified in this research correspond largely to prior predictions and encourage further research on appraisal-driven expression and inference. (shrink)

Tasks in the adult reasoning literature are designed so that heuristic processing leads one astray and adequate rule-based processing requires explicit knowledge about applicable logical and quasi-logical norms. Other research, however, indicates that appropriate rule-based inferences can be automatic. Individual differences in rationality are largely due to differences in developmental progress toward metacognitive understanding of both heuristic and rule-based inferences.

Martin Davies' criterion for the knowledge of implicit rules, viz. the causal systematicity of cognitive processes, is first exposed. Then the inference from causal systematicity of a process to syntactic properties of the input states is examined. It is argued that Davies' notion of a syntactic property is too weak to bear the conclusion that causal systematicity implies a language of thought as far as the input states are concerned. Next, it is shown that Davies' criterion leads to a (...) counterintuitive consequence: it groups together distributed connectionist systems with look-up tables. To avoid this consequence, a modified construal of causal systematicity is proposed and Davies' argument for the causal systematicity of thought is shown to be question-begging. It is briefly sketched how the modified construal links up with multiple dispositions of the same categorical base. Finally, the question of the causal efficacy of single rules is distinguished from the question of their psychological reality: implicit rules might be psychologically real without being causally efficacious. (shrink)

Can we base the whole of logic solely on the concept of incompatibility? My motivation for asking this is two-fold: firstly, a technical interest in what a minimal foundations of logic might be; and secondly, the existence of philosophers who have taken incompatibility as the ultimate key to human reason (viz., e.g., Hegel's concept of determinate negation). The main aim of this contribution is to tackle two related questions: Is it possible to reduce the foundations of logic to the mere (...) concept of incompatibility? and Does this reduction lead us to a specific logical system? We conclude that the answers, respectively, are YES and a qualified NO (qualified in the sense that basing semantics on incompatibility does make some logical systems more natural than others, but without ruling out the alternatives.) A search for the bare bones of logic generally leads one to the relation of inference (or consequence). This way is explored meticulously by Koslow (1992). He defines an implication structure as, in effect, an ordered pair , where S is a set and | f Pow(S)HS fulfilling certain (relatively simple) restrictions. And obviously if we reduce incompatibility to inference, which is achievable by the well known ex contradictione quodlibet principle, we reach a logic based on incompatibility. The kind of logic flowing most straightforwardly from this setting is the intuitionist one. However, there is also the approach taken by R. Brandom and A. Aker (2008), who have set up a logic based directly on incompatibility. They define an incompatibility structure as an ordered pair such that S is a set and z f Pow(S) (again fulfilling certain restrictions). The authors introduce logical operators in such a way that they reach classical logic. Does this mean that inference 'naturally' leads to intuitionist logic, whereas incompatibility leads to the classical one? Myself, I have argued that it is indeed intuitionist logic that is the logic of inference (see Peregrin, 2008).. (shrink)

The number of available legal documents has presented an enormous growth in recent years, and the digital processing of such materials is prompting the necessity of systems that support the automatic relevant information extraction. This work presents a system for ontology-based information extraction from natural language texts, able to identify a set of legal events. The system is based on an innovative methodology based on domain ontology of legal events and a set of linguistic rules, integrated through (...) inference mechanism, resulting in a flexible approach and scalable approach. A case study with the use of documents from the Superior Court in Brazil is related, with satisfactory results in precision and recall. (shrink)

Rule-based ethical theories like Kant's appear to be promising for machine ethics because of the computational structure of their judgments. On one formalist interpretation of Kant's categorical imperative, for instance, a machine could place prospective actions into the traditional deontic categories (forbidden, permissible, obligatory) by a simple consistency test on the maxim of action. We might enhance this test by adding a declarative set of subsidiary maxims and other "buttressing" rules. The ethical judgment is then an outcome of (...) the consistency test. While this kind of test can generate results, it may be vacuous in the sense that it would do no more than forbid obviously contradictory maxims of action. It is also possible that the kind of inference in such a rule-based system may be non-monotonic. I discuss these challenges to a rule-based machine ethics, starting from the framework of Kantian ethics. (shrink)

This paper deals with Popper's little-known work on deductive logic, published between 1947 and 1949. According to his theory of deductive inference, the meaning of logical signs is determined by certain rules derived from ?inferential definitions? of those signs. Although strong arguments have been presented against Popper's claims (e.g. by Curry, Kleene, Lejewski and McKinsey), his theory can be reconstructed when it is viewed primarily as an attempt to demarcate logical from non-logical constants rather than as a semantic foundation (...) for logic. A criterion of logicality is obtained which is based on conjunction, implication and universal quantification as fundamental logical operations. (shrink)