Annotated defeasible logic

DOI10.1017/S1471068417000266MaRDI QIDQ4592709zbMATH OpenOpenAlexFDO

Authors Guido Governatori, Michael J. Maher

Publication date 8 November 2017

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.04734

zbMATH Keywords

nonmonotonic reasoningannotated logicslegal reasoningdefeasible logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

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.

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

• scientific article; zbMATH DE number 1696797 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• A kripke-kleene semantics for logic programs*
• A three-valued semantics for deductive databases and logic programs
• An inclusion theorem for defeasible logics
• Argumentation Semantics for Defeasible Logic
• DefLog: on the Logical Interpretation of Prima Facie Justified Assumptions
• Defeasible logic versus Logic Programming without Negation as Failure
• Interdefinability of defeasible logic and logic programming under the well-founded semantics
• Logic Programming with Defaults and Argumentation Theories
• Modelling and Analysing Qualitative Biological Models using Rewriting Logic
• Negation in logic programming
• On the correctness of unfold/fold transformation of normal and extended logic programs
• On the equivalence between logic programming semantics and argumentation semantics
• On the partial semantics for disjunctive deductive databases
• Propositional defeasible logic has linear complexity
• Relative expressiveness of defeasible logics
• Relative expressiveness of defeasible logics. II
• The rationale behind the concept of goal
• The well-founded semantics for general logic programs
• Well-founded semantics for defeasible logic

Cited in

(8)

• scientific article; zbMATH DE number 2019866 (Why is no real title available?)
• The Paraconsistent Logics PJ
• Rethinking defeasible reasoning: a scalable approach
• scientific article; zbMATH DE number 1735835 (Why is no real title available?)
• On the relation between vector annotated logic programs and defeasible theories
• Practical Normative Reasoning with Defeasible Deontic Logic
• scientific article; zbMATH DE number 1931921 (Why is no real title available?)
• Modal Rules: Extending Defeasible Logic with Modal Operators

Describes a project that uses

Uses Software

• DELORES

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)