Annotated defeasible logic

DOI10.1017/S1471068417000266zbMath1422.68219arXiv1707.04734MaRDI QIDQ4592709

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

annotated logics; nonmonotonic reasoning; legal reasoning; defeasible logic

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

Uses Software

• DELORES

Cites Work

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