Switch to: References

Add citations

You must login to add citations.
  1. A progression semantics for first-order logic programs.Yi Zhou & Yan Zhang - 2017 - Artificial Intelligence 250 (C):58-79.
    Download  
     
    Export citation  
     
    Bookmark  
  • John McCarthy's legacy.Leora Morgenstern & Sheila A. McIlraith - 2011 - Artificial Intelligence 175 (1):1-24.
    Download  
     
    Export citation  
     
    Bookmark  
  • On principle-based evaluation of extension-based argumentation semantics.Pietro Baroni & Massimiliano Giacomin - 2007 - Artificial Intelligence 171 (10-15):675-700.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Audiences in argumentation frameworks.Trevor J. M. Bench-Capon, Sylvie Doutre & Paul E. Dunne - 2007 - Artificial Intelligence 171 (1):42-71.
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • A theory of diagnosis from first principles.Raymond Reiter - 1987 - Artificial Intelligence 32 (1):57-95.
    Download  
     
    Export citation  
     
    Bookmark   134 citations  
  • Nonmonotonic inference based on expectations.Peter Gärdenfors & David Makinson - 1994 - Artificial Intelligence 65 (2):197-245.
    Download  
     
    Export citation  
     
    Bookmark   77 citations  
  • Alternative approaches to default logic.James P. Delgrande, Torsten Schaub & W. Ken Jackson - 1994 - Artificial Intelligence 70 (1-2):167-237.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • From statistical knowledge bases to degrees of belief.Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern & Daphne Koller - 1996 - Artificial Intelligence 87 (1-2):75-143.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Is intractability of nonmonotonic reasoning a real drawback?Marco Cadoli, Francesco M. Donini & Marco Schaerf - 1996 - Artificial Intelligence 88 (1-2):215-251.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Lattice-theoretic models of conjectures, hypotheses and consequences.Mingsheng Ying & Huaiqing Wang - 2002 - Artificial Intelligence 139 (2):253-267.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Measures of uncertainty in expert systems.Peter Walley - 1996 - Artificial Intelligence 83 (1):1-58.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • The Qualification Problem: A solution to the problem of anomalous models.Michael Thielscher - 2001 - Artificial Intelligence 131 (1-2):1-37.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A modal logic for subjective default reasoning.Shai Ben-David & Rachel Ben-Eliyahu-Zohary - 2000 - Artificial Intelligence 116 (1-2):217-236.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Lexicographic priorities in default logic.Jussi Rintanen - 1998 - Artificial Intelligence 106 (2):221-265.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Rectifying the Mischaracterization of Logic by Mental Model Theorists.Selmer Bringsjord & Naveen Sundar Govindarajulu - 2020 - Cognitive Science 44 (12):e12898.
    Khemlani et al. (2018) mischaracterize logic in the course of seeking to show that mental model theory (MMT) can accommodate a form of inference (, let us label it) they find in a high percentage of their subjects. We reveal their mischaracterization and, in so doing, lay a landscape for future modeling by cognitive scientists who may wonder whether human reasoning is consistent with, or perhaps even capturable by, reasoning in a logic or family thereof. Along the way, we note (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Misleading higher-order evidence, conflicting ideals, and defeasible logic.Aleks Https://Orcidorg Knoks - 2020 - Ergo: An Open Access Journal of Philosophy 8:141--74.
    Thinking about misleading higher-order evidence naturally leads to a puzzle about epistemic rationality: If one’s total evidence can be radically misleading regarding itself, then two widely-accepted requirements of rationality come into conflict, suggesting that there are rational dilemmas. This paper focuses on an often misunderstood and underexplored response to this (and similar) puzzles, the so-called conflicting-ideals view. Drawing on work from defeasible logic, I propose understanding this view as a move away from the default metaepistemological position according to which rationality (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Counterpossibles and Normal Defaults in the Filioque Controversy.Jacob Archambault - 2019 - Logica Universalis 13 (4):443-455.
    A counterpossible conditional, or counterpossible for short, is a conditional proposition whose antecedent is impossible. The filioque doctrine is a dogma of western Christian Trinitarian theology according to which the Holy Spirit proceeds from the Father and the Son. The filioque doctrine was the principal theological reason for the Great Schism, the split between Eastern Orthodoxy and western Christianity, which continues today. In the paper, I review one of the earliest medieval defenses of the doctrine in Anselm of Canterbury, and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)An arugmentation framework for contested cases of statutory interpertation.Douglas Walton, Giovanni Sartor & Fabrizio Macagno - 2016 - Artificial Intelligence and Law 24 (1):51-91.
    This paper proposes an argumentation-based procedure for legal interpretation, by reinterpreting the traditional canons of textual interpretation in terms of argumentation schemes, which are then classified, formalized, and represented through argument visualization and evaluation tools. The problem of statutory interpretation is framed as one of weighing contested interpretations as pro and con arguments. The paper builds an interpretation procedure by formulating a set of argumentation schemes that can be used to comparatively evaluate the types of arguments used in cases of (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Reward versus risk in uncertain inference: Theorems and simulations.Gerhard Schurz & Paul D. Thorn - 2012 - Review of Symbolic Logic 5 (4):574-612.
    Systems of logico-probabilistic reasoning characterize inference from conditional assertions that express high conditional probabilities. In this paper we investigate four prominent LP systems, the systems _O, P_, _Z_, and _QC_. These systems differ in the number of inferences they licence _. LP systems that license more inferences enjoy the possible reward of deriving more true and informative conclusions, but with this possible reward comes the risk of drawing more false or uninformative conclusions. In the first part of the paper, we (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Extended Hierarchical Censored Production Rules (EHCPRs) System: An Approach Toward Generalized Knowledge Representation.N. K. Jain, K. K. Bharadwaj & Norian Marranghello - 1999 - Journal of Intelligent Systems 9 (3-4):259-295.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Applied Logic without Psychologism.Gregory Wheeler - 2008 - Studia Logica 88 (1):137-156.
    Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical ability to discriminate between different types of individuals, and another that concerns constitutive norms for reasoning as such. This essay embraces the former, permutation-invariance conception of logic and rejects the latter, Fregean conception of logic. The question of how to apply logic under this pure invariantist view is addressed, and a methodology (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Reasoning Processes as Epistemic Dynamics.Fernando R. Velázquez-Quesada - 2015 - Axiomathes 25 (1):41-60.
    This work proposes an understanding of deductive, default and abductive reasoning as different instances of the same phenomenon: epistemic dynamics. It discusses the main intuitions behind each one of these reasoning processes, and suggest how they can be understood as different epistemic actions that modify an agent’s knowledge and/or beliefs in a different way, making formal the discussion with the use of the dynamic epistemic logic framework. The ideas in this paper put the studied processes under the same umbrella, thus (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Dynamic Thoughts on Ifs and Oughts.Malte Willer - 2014 - Philosophers' Imprint 14:1-30.
    A dynamic semantics for iffy oughts offers an attractive alternative to the folklore that Chisholm's paradox enforces an unhappy choice between the intuitive inference rules of factual and deontic detachment. The first part of the story told here shows how a dynamic theory about ifs and oughts gives rise to a nonmonotonic perspective on deontic discourse and reasoning that elegantly removes the air of paradox from Chisholm's puzzle without sacrificing any of the two detachment principles. The second part of the (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • The Dramatic True Story of the Frame Default.Vladimir Lifschitz - 2015 - Journal of Philosophical Logic 44 (2):163-176.
    This is an expository article about the solution to the frame problem proposed in 1980 by Raymond Reiter. For years, his “frame default” remained untested and suspect. But developments in some seemingly unrelated areas of computer science—logic programming and satisfiability solvers—eventually exonerated the frame default and turned it into a basis for important applications.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • European Summer Meeting of the Association for Symbolic Logic.E. -J. Thiele - 1992 - Journal of Symbolic Logic 57 (1):282-351.
    Download  
     
    Export citation  
     
    Bookmark  
  • Defeasible logic programming: DeLP-servers, contextual queries, and explanations for answers.Alejandro J. García & Guillermo R. Simari - 2014 - Argument and Computation 5 (1):63-88.
    Argumentation represents a way of reasoning over a knowledge base containing possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a reasoning mechanism, the way an argumentation reasoning engine reaches these conclusions resembles the cognitive process that humans follow to analyze their beliefs; thus, unlike other computationally reasoning systems, argumentation offers an intellectually friendly alternative to other defeasible reasoning systems. LogicProgrammingisacomputationalparadigmthathasproducedcompu- tationallyattractivesystemswithremarkablesuccessinmanyapplications. Merging ideas from both areas, Defeasible Logic Programming offers a computational reasoning system that uses an argumentation engine (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Parainconsistency of credibility-based belief states.Anna Gomolińska - 2001 - Logic and Logical Philosophy 9:183.
    In our approach credibility of information plays an importantrole in modeling of both belief state and belief change [4]. It turns out thatthe credibility-based consequence operators used to define the notion of beliefstate tolerate inconsistency under some conditions.
    Download  
     
    Export citation  
     
    Bookmark  
  • What we know and the LTKB.Stanley Munsat - 1993 - Behavioral and Brain Sciences 16 (3):466-467.
    Download  
     
    Export citation  
     
    Bookmark  
  • Useful ideas for exploiting time to engineer representations.Richard Rohwer - 1993 - Behavioral and Brain Sciences 16 (3):471-471.
    Download  
     
    Export citation  
     
    Bookmark  
  • Time phases, pointers, rules and embedding.John A. Barnden - 1993 - Behavioral and Brain Sciences 16 (3):451-452.
    This paper is a commentary on the target article by Lokendra Shastri & Venkat Ajjanagadde [S&A]: “From simple associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony” in same issue of the journal, pp.417–451. -/- It puts S&A's temporal-synchrony binding method in a broader context, comments on notions of pointing and other ways of associating information - in both computers and connectionist systems - and mentions types of reasoning that are a challenge to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • How complicated is the set of stable models of a recursive logic program?W. Marek, A. Nerode & J. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):119-135.
    Gelfond and Lifschitz proposed the notion of a stable model of a logic program. We establish that the set of all stable models in a Herbrand universe of a recursive logic program is, up to recursive renaming, the set of all infinite paths of a recursive, countably branching tree, and conversely. As a consequence, the problem, given a recursive logic program, of determining whether it has at least one stable model, is Σ11-complete. Due to the equivalences established in the authors' (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Succinctness as a source of complexity in logical formalisms.Georg Gottlob, Nicola Leone & Helmut Veith - 1999 - Annals of Pure and Applied Logic 97 (1-3):231-260.
    The often observed complexity gap between the expressiveness of a logical formalism and its exponentially harder expression complexity is proven for all logical formalisms which satisfy natural closure conditions. The expression complexity of the prefix classes of second-order logic can thus be located in the corresponding classes of the weak exponential hierarchies; further results about expression complexity in database theory, logic programming, nonmonotonic reasoning, first-order logic with Henkin quantifiers and default logic are concluded. The proof method illustrates the significance of (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Expressiveness and definability in circumscription.Francicleber Martins Ferreira & Ana Teresa Martins - 2011 - Manuscrito 34 (1):233-266.
    We investigate expressiveness and definability issues with respect to minimal models, particularly in the scope of Circumscription. First, we give a proof of the failure of the Löwenheim-Skolem Theorem for Circumscription. Then we show that, if the class of P; Z-minimal models of a first-order sentence is Δ-elementary, then it is elementary. That is, whenever the circumscription of a first-order sentence is equivalent to a first-order theory, then it is equivalent to a finitely axiomatizable one. This means that classes of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)Burden of Proof in a Modified Hamblin Dialogue System.Douglas Walton - 2011 - Informal Logic 31 (4):279-304.
    In his book on fallacies, Hamblin built a very simple system for argumentation in dialogue he called the Why Because System with Questions. In his discussion of this system, he replaced the concept of burden of proof with a simpler concept of initiative, which could be described as something like getting the upper hand as the argumentation moves back and forth in the dialogue between the one party and the other. No doubt he realized that the concept of burden of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An Inductive Modal Approach for the Logic of Epistemic Inconsistency.Ricardo Silvestre - 2010 - Abstracta 6 (1):136-155.
    The purpose of this paper is twofold. First we want to extent a specific paranormal modal logic in such a way as obtain a paraconsistent and paracomplete multimodal logic able to formalize the notions of plausibility and certainty. With this logic at hand, and this is our second purpose, we shall use a modified version of Reiter‘s default logic to build a sort of inductive logic of plausibility and certainty able to represent some basic principles of epistemic inductive reasoning, such (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Some considerations on the logics PFD A logic combining modality and probability.Wiebe van der Hoeck - 1997 - Journal of Applied Non-Classical Logics 7 (3):287-307.
    ABSTRACT We investigate a logic PFD, as introduced in [FA]. In our notation, this logic is enriched with operators P> r(r € [0,1]) where the intended meaning of P> r φ is “the probability of φ (at a given world) is strictly greater than r”. We also adopt the semantics of [FA]: a class of “F-restricted probabilistic kripkean models”. We give a completeness proof that essentially differs from that in [FA]: our “peremptory lemma” (a lemma in PFD rather than about (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Semantics and Pragmatics of Locative Expressions.Annette Herskovits - 1985 - Cognitive Science 9 (3):341-378.
    The paper examines locative expressions and shows that an adequate account of their meaning must be based on two essential understandings: First, the simple spatial relation, often given as the meaning of the spatial prepositions, is only an “ideal” from which there are deviations in context; second, a level of “geometric conceptualization” mediates between “the world as it is” and language. Pragmatic “near principles” are formulated to explain some deviations from the ideal and several other apparent irregularities of prepositional use. (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Paranormal modal logic–Part I: The system K? and the foundations of the Logic of skeptical and credulous plausibility.Ricardo S. Silvestre - 2012 - Logic and Logical Philosophy 21 (1):65-96.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Graded Causation and Defaults.Joseph Y. Halpern & Christopher Hitchcock - 2015 - British Journal for the Philosophy of Science 66 (2):413-457.
    Recent work in psychology and experimental philosophy has shown that judgments of actual causation are often influenced by consideration of defaults, typicality, and normality. A number of philosophers and computer scientists have also suggested that an appeal to such factors can help deal with problems facing existing accounts of actual causation. This article develops a flexible formal framework for incorporating defaults, typicality, and normality into an account of actual causation. The resulting account takes actual causation to be both graded and (...)
    Download  
     
    Export citation  
     
    Bookmark   110 citations  
  • Dispositions, conditionals and auspicious circumstances.Justin C. Fisher - 2013 - Philosophical Studies 164 (2):443-464.
    A number of authors have suggested that a conditional analysis of dispositions must take roughly the following form: Thing X is disposed to produce response R to stimulus S just in case, if X were exposed to S and surrounding circumstances were auspicious, then X would produce R. The great challenge is cashing out the relevant notion of ‘auspicious circumstances’. I give a general argument which entails that all existing conditional analyses fail, and that there is no satisfactory way to (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Logic and Reality. [REVIEW]Christopher Menzel - 2000 - Philosophical Review 109 (2):281-286.
    Arthur Prior was a truly philosophical logician. Though he believed formal logic to be worthy of study in its own right, of course, the source of Prior’s great passion for logic was his faith in its capacity for clarifying philosophical issues, untangling philosophical puzzles, and solving philosophical problems. Despite the fact that he has received far less attention than he deserves, Prior has had a profound influence on the development of philosophical and formal logic over the past forty years, a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Three Faces of Defeasibility in the Law.Henry Prakken & Giovanni Sartor - 2004 - Ratio Juris 17 (1):118-139.
    In this paper we will analyse the issue of defeasibility in the law, taking into account research carried out in philosophy, artificial intelligence and legal theory. We will adopt a very general idea of legal defeasibility, in which we will include all different ways in which certain legal conclusions may need to be abandoned, though no mistake was made in deriving them. We will argue that defeasibility in the law involves three different aspects, which we will call inference‐based defeasibility, process‐based (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Defeasible reasoning and informal fallacies.Douglas Walton - 2011 - Synthese 179 (3):377 - 407.
    This paper argues that some traditional fallacies should be considered as reasonable arguments when used as part of a properly conducted dialog. It is shown that argumentation schemes, formal dialog models, and profiles of dialog are useful tools for studying properties of defeasible reasoning and fallacies. It is explained how defeasible reasoning of the most common sort can deteriorate into fallacious argumentation in some instances. Conditions are formulated that can be used as normative tools to judge whether a given defeasible (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On the logic of iterated belief revision.Adnan Darwiche & Judea Pearl - 1997 - Artificial Intelligence 89 (1-2):1-29.
    We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...)
    Download  
     
    Export citation  
     
    Bookmark   141 citations  
  • Well-founded semantics for defeasible logic.Frederick Maier & Donald Nute - 2010 - Synthese 176 (2):243 - 274.
    Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute's defeasible logic. The semantics are based upon the well-founded semantics for logic programs. It is shown that the logics are sound with respect to their counterpart semantics and complete for locally finite theories. Unlike some other nonmonotonic reasoning formalisms such as Reiter's default logic, the two defeasible logics are directly skeptical and so reject floating conclusions. For defeasible theories with transitive priorities on defeasible rules, the logics are shown (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Précis of bayesian rationality: The probabilistic approach to human reasoning.Mike Oaksford & Nick Chater - 2009 - Behavioral and Brain Sciences 32 (1):69-84.
    According to Aristotle, humans are the rational animal. The borderline between rationality and irrationality is fundamental to many aspects of human life including the law, mental health, and language interpretation. But what is it to be rational? One answer, deeply embedded in the Western intellectual tradition since ancient Greece, is that rationality concerns reasoning according to the rules of logic – the formal theory that specifies the inferential connections that hold with certainty between propositions. Piaget viewed logical reasoning as defining (...)
    Download  
     
    Export citation  
     
    Bookmark   113 citations  
  • Default logic as dynamic doxastic logic.Krister Segerberg - 1999 - Erkenntnis 50 (2-3):333-352.
    Dynamic doxastic logic (DDL) is used in connexion with theories of belief revision. Here we try to show that languages of DDL are suitable also for discussing aspects of default logic. One ingredient of our analysis is a concept of coherence-as-ratifiability.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Henry Prakken, logical tools for modelling legal argument: A study of defeasible reasoning in law. [REVIEW]L. M. M. Royakkers - 2000 - Journal of Logic, Language and Information 9 (3):379-387.
    Download  
     
    Export citation  
     
    Bookmark  
  • An interpretation of default logic in minimal temporal epistemic logic.Joeri Engelfriet & Jan Treur - 1998 - Journal of Logic, Language and Information 7 (3):369-388.
    When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown that this interpretation yields a semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Linear, branching time and joint closure semantics for temporal logic.Joeri Engelfriet & Jan Treur - 2002 - Journal of Logic, Language and Information 11 (4):389-425.
    Temporal logic can be used to describe processes: their behaviour ischaracterized by a set of temporal models axiomatized by a temporaltheory. Two types of models are most often used for this purpose: linearand branching time models. In this paper a third approach, based onsocalled joint closure models, is studied using models which incorporateall possible behaviour in one model. Relations between this approach andthe other two are studied. In order to define constructions needed torelate branching time models, appropriate algebraic notions are (...)
    Download  
     
    Export citation  
     
    Bookmark