Representation results for defeasible logic

@article{Antoniou2001RepresentationRF,
  title={Representation results for defeasible logic},
  author={Grigoris Antoniou and David Billington and Guido Governatori and Michael J. Maher},
  journal={ACM Trans. Comput. Log.},
  year={2001},
  volume={2},
  pages={255-287}
}
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the… 
View on ACM
arxiv.org
356 Citations
Highly Influential Citations
18
Background Citations
169
Methods Citations
96
Results Citations
8

Figures from this paper

356 Citations

On the Equivalence of Defeasible Deontic Logic and Temporal Defeasible Logic
In this paper we formally prove that compliance results derived from temporal defeasible logic are equivalent to the ones obtained in the standard defeasible deontic logic. In order to do so we first…
Temporal Extensions to Defeasible Logic
TLDR
The logic is extended to cope with durative facts, as well as with delays between the antecedent and the consequent of rules, and it is shown that the extended temporalised framework is suitable to model different types of causal relations.
Formalizing Defeasible Logic in CAKE
TLDR
This paper provides a new variant of defeasible logic, using CAKE method, that is tractable and properly deals with circular defeasibility rules.
An inclusion theorem for defeasible logics
TLDR
This article provides a compact presentation of the defeasible logic variants, and derives an inclusion theorem which shows that different notions of provability in defeasable logic form a chain of levels of proof.
Defeasible logic with dynamic priorities
TLDR
This article shows how dynamic priorities can be integrated, where priority information is obtained from the deductive process itself, and defines a proof theory, study its formal properties, and provide an argumentation semantics.
A Model-Theoretic Semantics for Defeasible Logic
  • Michael J. Maher
  • Computer Science, Philosophy
    Paraconsistent Computational Logic
  • 2002
TLDR
A model-theoretic semantics is given for defeasible logic, sound and complete with respect to the semantics, and how this approach extends to a wide range ofdefeasible logics is outlined.
Possible World Semantics for Defeasible Deontic Logic
TLDR
This paper addresses the issue of possible world semantics for (modal) defeasible logics and defines proof theoretically based on the proof conditions for the logic.
Argumentation Semantics for Defeasible Logics
TLDR
An argumentation-based semantics for an ambiguity propagating logic is presented, which shows that defeasible logics can be characterised in a similar way as well as proof-theoretically.
Defeasible Reasoning via Datalog¬
TLDR
This work addresses the problem of compiling defeasible theories to Datalog¬ programs and identifies structural properties of DL(∂||) that support efficient implementation and/or approximation of the conclusions of defeasibility theories in the logic.
Defeasible reasoning: A discussion of some intuitions
  • G. Antoniou
  • Computer Science, Philosophy
    Int. J. Intell. Syst.
  • 2006
In this article, we discuss some issues related to the intuitions of defeasible reasoning, in particular floating conclusions, reinstatement, and zombie paths. Defeasible logic serves as the formal…
...
...

References

SHOWING 1-10 OF 38 REFERENCES
A Study of Provability in Defeasible Logic
TLDR
It is shown that defeaters do not add to the expressiveness of defeasible logic, among other results, and the analysis supports the restriction ofdefeasible logic to admit only acyclic superiority relations.
Normal Forms for Defeasible Logic
TLDR
This paper derives some representation results for defeasible logic and shows that the superiority relation does not add to the expressive power of the logic, and can be simulated by other ingredients in a modular way.
Efficient defeasible reasoning systems
TLDR
It is believed that defeasible logic, with its efficiency and simplicity is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.
Defeasible Logic is Stable
TLDR
This work defines, and gives some of the intuition behind the definition of, a nonmonotonic logic called defeasible logic, and shows how well the definition captures the authors' intuitions.
Defeasible Logic versus Logic Programming without Negation as Failure
Modeling defeasible reasoning with multiple agents
TLDR
The authors present a proof theory and semantics for a logic that makes it possible to explicitly model internal perspectives or multiple agents and shows how it is possible to specify the relative superiority of some experts over others in a natural way using ordered logic.
Transformation of Logic Programs: Foundations and Techniques
On the analysis of regulations using defeasible rules
TLDR
This paper claims that automated support for reasoning with regulations can be provided on the basis of defeasible logical rules, and illustrates some aspects using examples from one specific domain: university regulations.
Defeasible Reasoning
TLDR
A general theory of warrant, based on defeasible reasons, is developed and used as guide in the construction of theory of defeosible reasoning, and a computer program implementing that theory is developed.
Deimos: Query answering defeasible logic system
TLDR
Deimos is a complete implementation of propositional Defeasible logic and some variants, which includes command-line-driven theorem provers and a web-accessible theorem prover.
...
...