Abstract
The proofs of theorems in default logic are often quite complicated and therefore error-prone. In this paper we introduce an operational interpretation of default logic and show its usefulness in providing technically simpler proofs for well-known results. We especially turn our attention to ordered, semi-normal default theories. We point out that Etherington's result and most of the citations and improvements in the literature are wrong, give the correct version and a totally new, technically clearer and more comprehensive proof.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
G. Antoniou and V. Sperschneider, Computing extensions of nonmonotonic logics,Proc. Scandinavian Conf. on Artificial Intelligence (SCAI-93), (IOS Press, 1993).
P. Besnard,An Introduction to Default Logic (Springer, 1989).
D.W. Etherington, Formalizing nonmonotonic reasoning systems, Artificial Intelligence 31 (1987) 41–85.
W. Łukaszewicz,Non-Monotonie Reasoning (Ellis Horwood, 1990).
V.W. Marek and M. Truszczynski,Nonmonotonic Logic — Context-Dependent Reasoning (Springer, 1993).
R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81–132.
J. Remmel, Various aspects of nonmonotonic rule systems,Talk at the 1993 Dagstuhl Seminar on Non-Classical Logics in Computer Science.
V. Sperschneider and G. Antoniou,Logic: A Foundation for Computer Science (Addison-Wesley 1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Antoniou, G., Langetepe, E. & Sperschneider, V. New proofs in default logic theory. Ann Math Artif Intell 12, 215–229 (1994). https://doi.org/10.1007/BF01530786
Issue Date:
DOI: https://doi.org/10.1007/BF01530786