pith. sign in

arxiv: 2604.19036 · v1 · submitted 2026-04-21 · 💻 cs.AI · cs.LO

Plausible Reasoning and First-Order Plausible Logic

David Billington This is my paper

Pith reviewed 2026-05-10 02:14 UTC · model grok-4.3

classification 💻 cs.AI cs.LO
keywords plausible reasoningdefeasible logicnonmonotonic reasoningfirst-order logicartificial intelligencereasoning algorithmsdefeasible statements
0
0 comments X

The pith

Plausible Logic defines a first-order system that reasons from facts and defeasible statements without numbers while meeting nearly all required principles.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Plausible reasoning draws conclusions from statements that are usually true but can occasionally fail, without invoking probabilities or other numeric measures. The paper identifies seventeen principles for logics that perform this kind of reasoning, of which fourteen are necessary and three are desirable. It then constructs a first-order logic called Plausible Logic that satisfies all necessary principles plus one desirable principle and produces the intuitively correct conclusions on standard examples. Because different sensible conclusions can sometimes be drawn from the same premises, Plausible Logic supplies eight distinct reasoning algorithms. A sympathetic reader would see this as supplying a formal, non-numeric foundation for handling everyday uncertain knowledge.

Core claim

The paper defines Plausible Logic (PL) as a first-order logic that satisfies fourteen necessary principles and one desirable principle of plausible reasoning, reasons correctly on all examined examples, and is the only known logic with these properties. PL supports eight reasoning algorithms to accommodate the fact that a single plausible-reasoning situation can yield several sensible conclusions.

What carries the argument

Plausible Logic (PL), a first-order logic equipped with eight reasoning algorithms that operates directly on facts and defeasible statements according to the stated principles.

If this is right

  • PL supplies a formal non-numeric method for nonmonotonic inference.
  • The eight algorithms allow different but equally defensible conclusions to be drawn from the same premises.
  • The logic extends classical first-order reasoning to cover defeasible statements.
  • Proofs establishing that PL meets the principles are provided in the accompanying book.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • PL could serve as a foundation for expert systems or AI planners that must act on incomplete or exception-prone knowledge.
  • Formalizing the remaining two desirable principles might yield a still stronger logic.
  • Empirical tests on large knowledge bases of everyday rules would show whether the eight algorithms scale to practical problems.

Load-bearing premise

The seventeen principles correctly capture what plausible reasoning requires and the chosen examples are sufficient to show that PL works.

What would settle it

Presentation of another first-order logic that satisfies more than one of the desirable principles while still handling the same examples correctly would falsify the uniqueness claim.

read the original abstract

Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers. So there are no probabilities or suchlike involved. Seventeen principles of logics that do plausible reasoning are suggested and several important plausible reasoning examples are considered. There are 14 necessary principles and 3 desirable principles, one of which is not formally stated. A first-order logic, called Plausible Logic (PL), is defined that satisfies all but two of the desirable principles and reasons correctly with all the examples. As far as we are aware, this is the only such logic. PL has 8 reasoning algorithms because, from a given plausible reasoning situation, there are different sensible conclusions. This article is a condensation of my book `Plausible Reasoning and Plausible Logic' (PRPL), which is to be submitted. Each section of this article corresponds to a chapter in PRPL, and vice versa. The proofs of all the results are in PRPL, so they are omitted in this article.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 1 minor

Summary. The paper proposes 17 principles (14 necessary, 3 desirable) for non-numerical plausible reasoning with defeasible statements, presents several examples of such reasoning, and defines a first-order Plausible Logic (PL) with 8 reasoning algorithms. It claims that PL satisfies all but two of the desirable principles, correctly handles the examples, and is the only such logic; the article is a condensation of a forthcoming book (PRPL) in which all proofs are located.

Significance. If the omitted proofs confirm that PL satisfies the stated principles and examples, the work would offer a self-contained non-probabilistic framework for defeasible reasoning that meets a broad set of author-proposed criteria, potentially useful for AI systems handling uncertain knowledge. The claim of uniqueness would also be noteworthy if independently verified.

major comments (3)
  1. [Abstract, §1] Abstract and §1: the central claim that PL 'satisfies all but two of the desirable principles and reasons correctly with all the examples' cannot be assessed because every proof is omitted and deferred to the book PRPL; without at least a sketch of the key derivations or the full formal definition of PL, independent verification of soundness is impossible.
  2. [Abstract] Abstract: one of the three desirable principles is stated only informally, so it is impossible to check whether PL satisfies it or to evaluate the precise scope of the 'all but two' claim.
  3. [§1] §1 and the principle list: the 17 principles are introduced by the author and PL is then defined to satisfy them, with validation performed only on author-selected examples; this creates a circularity risk that must be addressed by showing that the principles are independently motivated and that the examples are representative rather than tailored.
minor comments (1)
  1. [Abstract] The correspondence between article sections and book chapters is stated but not used to guide the reader on which omitted material is essential for the main claims.

Simulated Author's Rebuttal

3 responses · 1 unresolved

We thank the referee for the careful and constructive review. We address each major comment point by point below. This paper is a condensation of the forthcoming book PRPL, which limits the level of detail we can include while still conveying the core contributions.

read point-by-point responses

  1. Referee: [Abstract, §1] Abstract and §1: the central claim that PL 'satisfies all but two of the desirable principles and reasons correctly with all the examples' cannot be assessed because every proof is omitted and deferred to the book PRPL; without at least a sketch of the key derivations or the full formal definition of PL, independent verification of soundness is impossible.

    Authors: We acknowledge that the proofs are omitted because this article is a condensation of PRPL, where the complete formal definition of PL, the eight reasoning algorithms, and all derivations appear. The paper does include the definition of PL and states its properties, but we agree a high-level sketch of how the algorithms establish satisfaction of the principles would aid independent assessment. In revision we will add a concise overview of the key reasoning steps and satisfaction arguments in the main text, while continuing to refer readers to PRPL for the full proofs. revision: partial

  2. Referee: [Abstract] Abstract: one of the three desirable principles is stated only informally, so it is impossible to check whether PL satisfies it or to evaluate the precise scope of the 'all but two' claim.

    Authors: We accept the point. The principle in question is presented informally in the abstract for brevity but is elaborated in Section 1. We will revise the abstract to include a formal statement of this principle so that the scope of the 'all but two' claim is fully explicit. revision: yes

  3. Referee: [§1] §1 and the principle list: the 17 principles are introduced by the author and PL is then defined to satisfy them, with validation performed only on author-selected examples; this creates a circularity risk that must be addressed by showing that the principles are independently motivated and that the examples are representative rather than tailored.

    Authors: The principles were distilled from standard intuitions and cases in the non-monotonic reasoning and AI literature, as noted in the introduction. The examples are drawn from well-known test cases in defeasible reasoning. To reduce any appearance of circularity we will expand the discussion in Section 1 to cite prior work motivating each principle and to explain why the chosen examples are representative of the broader class of plausible-reasoning problems. revision: yes

standing simulated objections not resolved
  • The complete formal proofs and detailed derivations of all results, which reside exclusively in the forthcoming book PRPL and are omitted from this condensed article.

Circularity Check

1 steps flagged

Author-proposed principles and author-defined PL create satisfaction by construction

specific steps
  1. self definitional [Abstract]
    "Seventeen principles of logics that do plausible reasoning are suggested and several important plausible reasoning examples are considered. There are 14 necessary principles and 3 desirable principles, one of which is not formally stated. A first-order logic, called Plausible Logic (PL), is defined that satisfies all but two of the desirable principles and reasons correctly with all the examples. As far as we are aware, this is the only such logic."

    The principles are suggested by the author within the paper, after which PL is defined such that it satisfies them and handles the chosen examples. The satisfaction claim therefore holds by the construction of PL rather than by any independent derivation or verification supplied in the article (proofs are explicitly omitted).

full rationale

The paper proposes 17 principles (14 necessary, 3 desirable), then defines PL to satisfy all but two desirable ones while correctly handling author-selected examples. All proofs are omitted and deferred to the author's forthcoming book. This makes the central claim of satisfaction definitional rather than independently derived, producing partial circularity. No external benchmarks or machine-checked results are supplied in the article itself.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the author's proposed 17 principles serving as the correct requirements for plausible reasoning and on the subsequent definition of PL satisfying them, with examples providing the only external check visible in the abstract.

axioms (1)
  • domain assumption There exist 17 principles (14 necessary and 3 desirable) that any correct plausible reasoning system must satisfy.
    These principles are suggested by the author as the foundation for the logic.

pith-pipeline@v0.9.0 · 5482 in / 1206 out tokens · 52157 ms · 2026-05-10T02:14:52.716724+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

130 extracted references · 130 canonical work pages

  1. [1]

    Principles of Logics for Plausible Reasoning , volume =

    David Billington , date-added =. Principles of Logics for Plausible Reasoning , volume =. Journal of Logic and Computation , keywords =

    work page

  2. [2]

    Enderton , date-added =

    Herbert B. Enderton , date-added =. Elements of Set Theory , year =

    work page

  3. [3]

    Easwaran and A

    K. Easwaran and A. Hajek and P. Mancosu and G. Oppy , booktitle =. Infinity , url =. 2025 , bdsk-url-1 =

    work page 2025

  4. [4]

    Factual and Plausible Reasoning , volume =

    David Billington , date-added =. Factual and Plausible Reasoning , volume =

    work page

  5. [5]

    Set Theory , url =

    Joan Bagaria , booktitle =. Set Theory , url =. 2023 , bdsk-url-1 =

    work page 2023

  6. [6]

    Russell's Paradox , url =

    Harry Deutsch and Andrew David Irvine , booktitle =. Russell's Paradox , url =. 2026 , bdsk-url-1 =

    work page 2026

  7. [7]

    Cholewinski and V.W

    P. Cholewinski and V.W. Marek and A. Mikitiuk and M. Truszczynski , booktitle =. Experimenting with Nonmonotonic Reasoning , year =

    work page

  8. [9]

    Kernel Contraction , volume =

    Sven Ove Hansson , date-added =. Kernel Contraction , volume =. The Journal of Symbolic Logic , month =

    work page

  9. [10]

    Reasoning with Contradictory Information using Quasi-classical Logic , volume =

    Anthony Hunter , date-added =. Reasoning with Contradictory Information using Quasi-classical Logic , volume =. Journal of Logic and Computation , number =

    work page

  10. [11]

    Deagustini and M.V

    C.A.D. Deagustini and M.V. Martiinez and M.A. Falappa and G.R. Simari , booktitle =. Inconsistency resolution and global conflicts , year =

    work page

  11. [12]

    Deagustini and M.V

    C.A.D. Deagustini and M.V. Martiinez and M.A. Falappa and G.R. Simari , booktitle =. Improving Inconsistency Resolution by Considering Global Conflicts , volume =

    work page

  12. [13]

    Kraus and D

    S. Kraus and D. Lehmann and M. Magidor , date-added =. Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , year =. arXiv:cs.AI/0202021v1 , month =

    work page arXiv

  13. [14]

    Logic, Semantics, Metamathematics

    Alfred Tarski , date-added =. Logic, Semantics, Metamathematics. Papers from 1923 to 1938. , year =

    work page 1923

  14. [15]

    Gabbay , date-added =

    Dov M. Gabbay , date-added =. Investigations in Modal and Tense Logics with Applications to Problems in Philosophy and Linguistics , year =

    work page

  15. [16]

    Explanatory Nonmonotonic Reasoning , volume =

    Alexander Bochman , date-added =. Explanatory Nonmonotonic Reasoning , volume =

    work page

  16. [17]

    A Logical Theory of Nonmonotonic Inference and Belief Change , year =

    Alexander Bochman , date-added =. A Logical Theory of Nonmonotonic Inference and Belief Change , year =

    work page

  17. [18]

    Completeness and Axiomatizability in Many-valued Logic , volume =

    Dana Stewart Scott , booktitle =. Completeness and Axiomatizability in Many-valued Logic , volume =

    work page

  18. [19]

    Maher , date-added =

    Guido Governatori and Michael J. Maher , date-added =. Annotated Defeasible Logic , year =. arXiv:1707.04734v1 , month =

    work page arXiv

  19. [20]

    Australian Law Dictionary , year =

    work page

  20. [21]

    Nonmonotonic Reasoning: from Finitary Relations to Infinitary Inference Operations , volume =

    Michael Freund and Daniel Lehmann , date-added =. Nonmonotonic Reasoning: from Finitary Relations to Infinitary Inference Operations , volume =. Studia Logica , keywords =

    work page

  21. [22]

    Nonmonotonic Inference Operations , volume =

    Michael Freund and Daniel Lehmann , date-added =. Nonmonotonic Inference Operations , volume =. Logic Journal of the IGPL , number =

    work page

  22. [23]

    On the Entailment Problem for a Logic of Typicality , year =

    Richard Booth and Giovanni Casini and Thomas Meyer and Ivan Varzinczak , booktitle =. On the Entailment Problem for a Logic of Typicality , year =

    work page

  23. [24]

    A Propositional Typicality Logic for Extending Rational Consequence , volume =

    Richard Booth and Thomas Meyer and Ivan Varzinczak , booktitle =. A Propositional Typicality Logic for Extending Rational Consequence , volume =

    work page

  24. [25]

    Ordered logic: defeasible reasoning for multiple agents , volume =

    Patricia Geerts and Dirk Vermeir and Donald Nute , date-added =. Ordered logic: defeasible reasoning for multiple agents , volume =. Decision Support Systems , pages =

    work page

  25. [26]

    A Logical Framework for Default Reasoning , volume =

    David Poole , date-added =. A Logical Framework for Default Reasoning , volume =. Artificial Intelligence , pages =

    work page

  26. [27]

    Preferred Subtheories: An Extended Logical Framework for Default Reasoning , volume =

    Gerhard Brewka , booktitle =. Preferred Subtheories: An Extended Logical Framework for Default Reasoning , volume =

    work page

  27. [28]

    Horty and Richmond H

    John F. Horty and Richmond H. Thomason and David S. Touretzky , date-added =. A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , volume =. Artificial Intelligence , pages =

    work page

  28. [29]

    Conditional Objects and Non-Monotonic Reasoning , year =

    Didier Dubois and Henri Prade , booktitle =. Conditional Objects and Non-Monotonic Reasoning , year =

    work page

  29. [30]

    Representing Default Rules in Possibilistic Logic , year =

    Salem Benferhat and Didier Dubois and Henri Prade , booktitle =. Representing Default Rules in Possibilistic Logic , year =

    work page

  30. [31]

    Unifying Default Reasoning and Belief Revision in a Modal Framework , volume =

    Craig Boutilier , date-added =. Unifying Default Reasoning and Belief Revision in a Modal Framework , volume =. Artificial Intelligence , number =

    work page

  31. [32]

    On the Connection between Non-Monotonic Inference Systems and Conditional Logics , year =

    Gabriella Crocco and Philippe Lamarre , booktitle =. On the Connection between Non-Monotonic Inference Systems and Conditional Logics , year =

    work page

  32. [33]

    Burgess , date-added =

    John P. Burgess , date-added =. Quick Completeness Proofs for Some Logics of Conditionals , volume =. Notre Dame Journal of Formal Logic , number =

    work page

  33. [34]

    Conditional Logics of Normality: A Modal Approach , volume =

    Craig Boutilier , date-added =. Conditional Logics of Normality: A Modal Approach , volume =. Artificial Intelligence , number =

    work page

  34. [35]

    S4 as the Conditional Logic of Nonmonotonicity , year =

    Philippe Lamarre , booktitle =. S4 as the Conditional Logic of Nonmonotonicity , year =

    work page

  35. [36]

    Dubois and J

    D. Dubois and J. Lang and H. Prade , booktitle =. Possibilistic logic , volume =

    work page

  36. [37]

    The Logic of Conditionals: An Application of Probability to Deductive Logic , year =

    Ernest Wilcox Adams , date-added =. The Logic of Conditionals: An Application of Probability to Deductive Logic , year =

    work page

  37. [38]

    Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

    Judea Pearl , date-added =. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. , year =

    work page

  38. [39]

    Probabilistic Semantics for Nonmonotonic Reasoning: A survey , year =

    Judea Pearl , booktitle =. Probabilistic Semantics for Nonmonotonic Reasoning: A survey , year =

    work page

  39. [40]

    The Logic of Conditionals , year =

    Horacio Arlo-Costa and Paul Egr. The Logic of Conditionals , year =. The Stanford Encyclopedia of Philosophy , date-added =

    work page

  40. [41]

    Cross , booktitle =

    Donald Nute and Charles B. Cross , booktitle =. Conditional Logic , volume =

    work page

  41. [42]

    Delgrande , date-added =

    James P. Delgrande , date-added =. On a Rule-Based Interpretation of Default Conditionals , volume =. Annals of Mathematics and Artificial Intelligence , pages =

    work page

  42. [43]

    What does a conditional knowledge base entail? , volume =

    Daniel Lehmann and Menachem Magidor , date-added =. What does a conditional knowledge base entail? , volume =. Artificial Intelligence , month =

    work page

  43. [44]

    Simari and Ronald P

    Guillermo R. Simari and Ronald P. Loui , date-added =. A mathematical treatment of defeasible reasoning and its implementation , volume =. Artificial Intelligence , pages =

    work page

  44. [45]

    Conditional entailment: bridging two approaches to default reasoning , volume =

    Hector Geffner and Judea Pearl , date-added =. Conditional entailment: bridging two approaches to default reasoning , volume =. Artificial Intelligence , pages =

    work page

  45. [46]

    System-Z+: A Formalism for Reasoning with Variable-Strength Defaults , year =

    Mois. System-Z+: A Formalism for Reasoning with Variable-Strength Defaults , year =. Proceedings AAAI-91 , date-added =

    work page

  46. [47]

    System Z: A Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning , year =

    Judea Pearl , booktitle =. System Z: A Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning , year =

    work page

  47. [48]

    Defeasible Logics , volume =

    Patricia Geerts and Els Laenens and Dirk Vermier , booktitle =. Defeasible Logics , volume =

    work page

  48. [49]

    The Quantitative/Qualitative Watershed for Rules of Uncertain Inference , volume =

    James Hawthorne and David Makinson , date-added =. The Quantitative/Qualitative Watershed for Rules of Uncertain Inference , volume =. Studia Logica , pages =

    work page

  49. [50]

    Lossy Inference Rules and their Bounds: a Brief Review , volume =

    David Makinson and James Hawthorne , booktitle =. Lossy Inference Rules and their Bounds: a Brief Review , volume =

    work page

  50. [51]

    Logical Questions behind the Lottery and Preface Paradoxes: Lossy Rules for Uncertain Inference , volume =

    David Makinson , date-added =. Logical Questions behind the Lottery and Preface Paradoxes: Lossy Rules for Uncertain Inference , volume =. Synthese , pages =

    work page

  51. [52]

    General Patterns in Nonmonotonic Reasoning , volume =

    David Makinson , booktitle =. General Patterns in Nonmonotonic Reasoning , volume =

    work page

  52. [53]

    C. E. Alchourr. On the logic of theory change: Partial meet contraction and revision functions , volume =. Journal of Symbolic Logic , month =

    work page

  53. [54]

    A Propositional Plausible Logic , volume =

    David Billington , booktitle =. A Propositional Plausible Logic , volume =

    work page

  54. [55]

    Walton and C.W

    D. Walton and C.W. Tindale and T.F. Gordon , date-added =. Applying Recent Argumentation Methods to Some Ancient Examples of Plausible Reasoning , volume =. Argumentation , pages =

    work page

  55. [56]

    Knowledge in Flux

    Peter G\". Knowledge in Flux. Modeling the Dynamics of Epistemic States. , year =

    work page

  56. [57]

    Instantiating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties , volume =

    Nikos Gorogiannis and Anthony Hunter , date-added =. Instantiating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties , volume =. Artificial Intelligence , pages =

    work page

  57. [58]

    Caminada and Walter A

    Martin W.A. Caminada and Walter A. Carnielli and Paul E. Dunne , date-added =. Semi-stable Semantics , volume =. Journal of Logic and Computation , number =

    work page

  58. [59]

    A General Account of Argumentation with Preferences , volume =

    Sanjay Modgil and Henry Prakken , date-added =. A General Account of Argumentation with Preferences , volume =. Artificial Intelligence , pages =

    work page

  59. [60]

    Touretzky and J.F

    D.S. Touretzky and J.F. Horty and R.H. Thomason , booktitle =. A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , volume =

    work page

  60. [61]

    Covington and D

    M.A. Covington and D. Nute and A. Vellino , date-added =. Prolog Programming in Depth , year =

    work page

  61. [62]

    Pollock , date-added =

    J.L. Pollock , date-added =. Defeasible Reasoning , volume =. Cognitive Science , number =

    work page

  62. [63]

    Lifschitz , booktitle =

    V. Lifschitz , booktitle =. Benchmark Problems for Formal Nonmonotonic Reasoning , volume =

    work page

  63. [64]

    Prakken and G

    H. Prakken and G. Sartor , date-added =. Argument-based Extended Logic Programming with Defeasible Priorities , volume =. Journal of Applied Non-Classical Logics , number =

    work page

  64. [65]

    What the Lottery Paradox Tells Us About Default Reasoning , year =

    David Poole , booktitle =. What the Lottery Paradox Tells Us About Default Reasoning , year =

    work page

  65. [66]

    Makinson , booktitle =

    D. Makinson , booktitle =. General Theory of Cumulative Inference , volume =

    work page

  66. [67]

    Kraus and D

    S. Kraus and D. Lehmann and M. Magidor , date-added =. Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , volume =. Artificial Intelligence , month =

    work page

  67. [68]

    Gabbay , booktitle =

    D.M. Gabbay , booktitle =. Theoretical Foundations for Non-monotonic Reasoning in Expert Systems , year =

    work page

  68. [69]

    Caminada and L

    M. Caminada and L. Amgoud , date-added =. On the Evaluation of Argumentation Formalisms , volume =. Artificial Intelligence , pages =

    work page

  69. [70]

    Billington , booktitle =

    D. Billington , booktitle =. A Defeasible Logic for Clauses , volume =

    work page

  70. [71]

    A. J. Garcia and G. R. Simari , date-added =. Defeasible logic programming: an argumentative approach , volume =. Theory and Practice of Logic Programming , keywords =

    work page

  71. [72]

    Wang and D

    K. Wang and D. Billington and J. Blee and G. Antoniou , booktitle =. Combining Description Logic and Defeasible Logic for the Semantic Web , volume =

    work page

  72. [73]

    Billington and V

    D. Billington and V. Estivill-Castro and R. Hexel and A. Rock , booktitle =. Modelling Behaviour Requirements for Automatic Interpretation, Simulation and Deployment , volume =

    work page

  73. [74]

    Billington and V

    D. Billington and V. Estivill-Castro and R. Hexel and A. Rock , booktitle =. Non-monotonic Reasoning for Requirements Engineering: State Diagrams Driven by Plausible Logic , year =

    work page

  74. [75]

    Billington and V

    D. Billington and V. Estivill-Castro and R. Hexel and A. Rock , booktitle =. Plausible Logic Facilitates Engineering the Behaviour of Autonomous Robots , year =

    work page

  75. [76]

    Billington and V

    D. Billington and V. Estivill-Castro and R. Hexel and A. Rock , booktitle =. Architecture for Hybrid Robotic Behavior , volume =

    work page

  76. [77]

    M. J. Maher and G. Governatori , booktitle =. A Semantic Decomposition of Defeasible Logics , year =

    work page

  77. [78]

    Wheeler , date-added =

    G. Wheeler , date-added =. Rational Acceptance and Conjunctive/Disjunctive Absorption , volume =. Journal of Logic, Language and Information , month =

    work page

  78. [79]

    H. E. Kyburg , date-added =. The Rule of Adjunction and Reasonable Inference , volume =. The Journal of Philosophy , month =

    work page

  79. [80]

    H. E. Kyburg , date-added =. Probability and the Logic of Rational Belief , year =

    work page

  80. [81]

    Antoniou and D

    G. Antoniou and D. Billington and G. Governatori and M. J. Maher , date-added =. Representational Results for Defeasible Logic , volume =. ACM Transactions on Computational Logic , month =

    work page

Showing first 80 references.