Efficient defeasible reasoning systems

@article{Maher2000EfficientDR,
  title={Efficient defeasible reasoning systems},
  author={Michael J. Maher and Andrew Rock and Grigoris Antoniou and David Billington and Tristan Miller},
  journal={Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000},
  year={2000},
  pages={384-392}
}
For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonic reasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward chaining approach, and a forward-chaining… 

Figures from this paper

Relating Defeasible Logic to Extended Logic Programs

This paper gives a translation of a defeasible theory D into a program P(D) and shows that under a condition of decisiveness, the defeasable consequences of D correspond exactly to the sceptical conclusions of P (D) under the answer set semantics.

Embedding Defeasible Logic into Logic Programs

This paper gives a translation of a defeasible theory D into a program P(D) and shows that under a condition of decisiveness, the defeasable consequences of D correspond exactly to the sceptical conclusions of P (D) under the stable model semantics.

Propositional Clausal Defeasible Logic

This work defines and explains a new defeasible logic, called clausal defeasibility logic (CDL), which has all these properties, and is easy to implement, consistent, detects loops, terminates, and has a range of deduction algorithms to cater for arange of intuitions.

Argumentation Semantics for Defeasible Logic

Dung-like argumentation semantics is provided for two key defeasible logics, of which one is ambiguity propagating and the other ambiguity blocking, which provides the first ambiguity blocking Dung- like argumentation system.

Argumentation Semantics for Defeasible Logics

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.

Embedding defeasible logic into logic programming

This paper gives a translation of a defeasible theory into a meta-program and shows that under a condition of decisiveness, the defeasable consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics.

Relating Defeasible and Default Logic

An ambiguity propagating defeasible logic can be directly embedded into default logic, and Computational complexity results suggest that default logics are more expressive than defeasibles logics.

A Family of Defeasible Reasoning Logics and its Implementation

This paper presents a family of defeasible reasoning formalisms built around Nute's defeasibility logic, and describes the motivations of these formalisms and derive some basic properties and interrelationships.

Defeasible logic with dynamic priorities

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 Non-Monotonic Reasoning System for RDF Metadata

This paper presents a system for non-monotonic reasoning on the Semantic Web called VDR-Device, which is capable of reasoning about RDF metadata over multiple Web sources using defeasible logic rules and features a RuleML compatible syntax.
...

References

SHOWING 1-10 OF 45 REFERENCES

Argumentation Semantics for Defeasible Logics

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.

Normal Forms for Defeasible Logic

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.

A Study of Provability in Defeasible Logic

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.

A modular translation from defeasible nets to defeasible logics

The sceptical inheritance nets introduced in Horty et al. are translated into a version of Nute's defeasible logic, and this result shows that the reasoning mechanisms underlying defeasibles logic and defeasibility nets are the same.

Defeasible Logic is Stable

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.

A Semantic Decomposition of Defeasible Logics

It is shown that Nute's Defeasible Logic corresponds to Kunen's semantics, and a defeasible logic is developed from the well-founded semantics of Van Gelder, Ross and Schlipf.

Propositional Plausible Logic: Introduction and Implementation

The implementation is evaluated experimentally, and is shown to be capable of handling tens of thousands of rules and sufficiently many disjunctions for realistic problems and to be the first complete implementation of propositional Plausible Logic.

Representation results for defeasible logic

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 other hand they have been used in the development of an efficient implementation of defeasible logic.

Argument-Based Extended Logic Programming with Defeasible Priorities

A semantics and proof theory of a system for defeasible argumentation in a logic-programming language with both weak and strong negation, where an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks.