Annotated defeasible logic
From MaRDI portal
Publication:4592709
DOI10.1017/S1471068417000266zbMATH Open1422.68219arXiv1707.04734OpenAlexW2964084085MaRDI QIDQ4592709FDOQ4592709
Authors: Guido Governatori, Michael J. Maher 
Publication date: 8 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. This limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in some legal settings, different actors have different burdens of proof, which might be expressed as reasoning in different defeasible logics. In this paper, we introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism. This paper is under consideration for acceptance in Theory and Practice of Logic Programming.
Full work available at URL: https://arxiv.org/abs/1707.04734
Recommendations
- scientific article; zbMATH DE number 1269578
- scientific article; zbMATH DE number 1696797
- scientific article; zbMATH DE number 1852916
- Well-founded semantics for defeasible logic
- scientific article; zbMATH DE number 2090541
- Argumentation Semantics for Defeasible Logic
- The Paraconsistent Logics PJ
- Embedding defeasible logic into logic programming
- scientific article; zbMATH DE number 1269577
Cites Work
- A three-valued semantics for deductive databases and logic programs
- On the partial semantics for disjunctive deductive databases
- The well-founded semantics for general logic programs
- Argumentation Semantics for Defeasible Logic
- A kripke-kleene semantics for logic programs*
- Negation in logic programming
- Propositional defeasible logic has linear complexity
- DefLog: on the Logical Interpretation of Prima Facie Justified Assumptions
- Title not available (Why is that?)
- On the correctness of unfold/fold transformation of normal and extended logic programs
- Title not available (Why is that?)
- An inclusion theorem for defeasible logics
- Well-founded semantics for defeasible logic
- Logic Programming with Defaults and Argumentation Theories
- On the equivalence between logic programming semantics and argumentation semantics
- Defeasible logic versus Logic Programming without Negation as Failure
- The rationale behind the concept of goal
- Interdefinability of defeasible logic and logic programming under the well-founded semantics
- Modelling and Analysing Qualitative Biological Models using Rewriting Logic
- Relative expressiveness of defeasible logics
- Relative expressiveness of defeasible logics. II
Cited In (8)
- Title not available (Why is that?)
- The Paraconsistent Logics PJ
- Rethinking defeasible reasoning: a scalable approach
- Title not available (Why is that?)
- On the relation between vector annotated logic programs and defeasible theories
- Practical Normative Reasoning with Defeasible Deontic Logic
- Title not available (Why is that?)
- Modal Rules: Extending Defeasible Logic with Modal Operators
Uses Software
This page was built for publication: Annotated defeasible logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592709)
