Abstract
We have presented a theoretical characterisation of sets of defaults generating an extension of a default theory: complete and regular universes. We have then defined the concept of valid exclusion, and have given with the help of that concept another characterisation of complete and regular universes. This last result allows us an encoding of a default theory into a set of clauses involving typed literals. Resolution followed by some deletion algorithms then computes every extension of the default theory. Contrary to previously published papers, this method works for any propositional default theory.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E Bonte, F. Levy: “Une procédure complète de calcul des extensions pour les théories de défauts en réseau” 7ème congrès AFCET-RFIA, Paris, Décembre 1989
Michel Cayrol, Pierre Tayrac: “ARC: un ATMS étendu”. L.S.I. Repport nℴ 323 Nov 1989
Johan De Kleer: “An assumption-based TMS”. Artificial Intelligence vol 28 1986 127–162
Johan De Kleer: “Extending the A.T.M.S.”. Artificial Intelligence vol 28 1986 163–196
O. Dressler: “Extending the Basic A.T.M.S.” Proceedings Ecai 88, München, Aug. 1988
David W. Etherington: “Formalizing Nonmonotonic Reasoning Systems”. Artificial Intelligence vol 31 1987
Ulrich Junker: “A Correct Non-Monotonic A.T.M.S.” Proceedings IJCAI 89, Detroit, Aug 1989 1049–1053
François Levy “Contribution à la réalisation d'un raisonneur à profondeur variable” Thése d'université, Université de Paris Nord, Feb. 1989
Raymond Reiter: “A logic for default reasoning” Artificial Intelligence vol 13 april 1980 81–132
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lévy, F. (1991). Computing extensions of default theories. 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_92
Download citation
DOI: https://doi.org/10.1007/3-540-54659-6_92
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