Abstract
An ordering on default rules is defined that formalises intuitive relationships between rules. Unlike Etherington's [Eth88] orderings on literals which were only used to guarantee the existence of a computable extension, ours are defined proof-theoretically and used as an integral part of an algorithm that efficiently calculates all extensions for several useful sub-classes of default logic. The algorithm represents a significant reduction in complexity over other existing methods, especially for large multi-domain examples where indepeneant partial extensions can be calculated for different groups of unrelated rules which can be combined to produce complete extensions. Also, by changing the definition of the orderings without altering the underlying algorithm, extensions can be calculated for variants of default logic that have been proposed since Reiter's original paper.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
G. Brewka. Cumulative default logic: In defense of nonmonotonic inference rules (draft). GMD, Postfach 1240, D5205 Sankt Augustin 1, Fed. Rep. of Germany, 1990.
D. W. Etherington. Reasoning with Incomplete Information. Pitman, London, 1988.
C. Froidevaux. Taxonomic default theories. In ECAI, pages 123–129, 1986.
M. S. Hopkins. The Implementation of a Plausible Inference System. PhD thesis, Queen Mary and Westfield, University of London, 1990.
U. Junker and K. Konolige. Computing the extensions of autoepistemic and default logics with a tms. In AAAI-90, pages 278–283, 1990.
H. A. Kautz and B. Selman. Hard problems for simple default logics. In Proc. 1st Int. Conf. on Principle of Knowledge Representation and Reasoning, pages 189–197, Toronto, 1989.
F. Levy. Computing extensions of default theories. In European Conference on Symbolic and Quantitative Approaches to Uncertainty, pages 219–226, Marseille, 1991. Springer-Verlag. Lecture Notes in Computer Science 548.
W. Lukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.
D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27–47, 1988.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hopkins, M. (1993). Default logic: Orderings and extensions. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028198
Download citation
DOI: https://doi.org/10.1007/BFb0028198
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57395-1
Online ISBN: 978-3-540-48130-0
eBook Packages: Springer Book Archive