Abstract
We present a formal framework for ordered default reasoning which has desirable mathematical properties yet is relatively simple and can be implemented using standard theorem provers. By expressing default logic as a relation from theories to extensions we are able to formalise Brewka's prioritized default logic as a composite relation. We also decompose the extension relation by factoring out deductive closure. The resulting augmentations can be computed for decidable cases, and provide an extension membership test for composite extensions. Finally we define the equivalent formalism in autoepistemic logic.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brewka, G. Preferred Subtheories: An Extended Logical Framework for Default Reasoning. In Proc. IJCAI-89, pp. 1043–1048, Detroit, USA, 1989.
Etherington, D. W. Formalizing Nonmonotonic Reasoning Systems. Artificial Intelligence, 31 pp. 41–85, 1987.
Hanks, S. and McDermott, D. Default Reasoning, Nonmonotonic Logics, and the Frame Problem. In Proc. AAAI-86, pp. 328–333, Philadelphia, USA, 1986.
Konolige, K. Hierarchic Autoepistemic Theories for Nonmonotonic Reasoning. In Proc. AAAI-88, pp. 439–443, Saint Paul, USA, 1988.
Konolige, K. On the Relation Between Default Theories and Autoepistemic Logic. Artificial Intelligence, 35 pp. 343–382, 1988.
MacNish, C. PhD thesis, Department of Engineering, Cambridge, UK, 1991. In preparation.
MacNish, C. Hierarchical Default Logic (Extended Version). Technical Report CUED/F-INFENG/TR.52, Cambridge University Engineering Department, 1991.
MacNish, C. Well-behaved Reasoning with Seminormal Defaults. In Proc. 4th International Symposium on AI, CancÚn, Mexico, November 1991. To appear.
McCarthy, J. Applications of Circumscription to Formalising Common-Sense Knowledge. Artificial Intelligence, 28 pp. 89–116, 1986.
Poole, D. L. On the Comparison of Theories: Preferring the Most Specific Explanation. In Proc. IJCAI-85, pp. 144–147, Los Angeles, CA, 1985.
Reiter, R. A Logic for Default Reasoning. Artificial Intelligence, 13 pp. 81–132, 1980.
Shoham, Y. Chronological Ignorance: Experiments in Nonmonotonic Temporal Reasoning. Artificial Intelligence, 36 pp. 279–331, 1988.
Touretzky, D. S., Horty, J. F. and Thomason, R. H. A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems. In Proc. IJCAI-87, pp. 476–482, Milan, Italy, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
MacNish, C. (1991). Hierarchical default logic. In: Kruse, R., Siegel, P. (eds) Symbolic and Quantitative Approaches to Uncertainty. ECSQARU 1991. Lecture Notes in Computer Science, vol 548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54659-6_96
Download citation
DOI: https://doi.org/10.1007/3-540-54659-6_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54659-7
Online ISBN: 978-3-540-46426-6
eBook Packages: Springer Book Archive