Abstract
Elaboration tolerance is “the ability of accepting changes to a person's or a computer program's representation of facts without starting all over” [8]. In this paper we investigate how abstraction (in the sense of [5]) helps in achieving a certain degree of elaboration tolerance. We do so by mechanizing in absfol (an interactive theorem prover with abstraction) two famous representations of the missionaries and cannibals problem and by showing how abstraction helps in finding solutions in such representations “...without starting all over.”
I am deeply grateful to SaŜa Buvaĉ. The original idea of the abstraction presented in this paper is his. Without his support and discussions this paper would have not been possible.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Saul Amarel. On representations of problems of reasoning about actions. In Donald Michie, editor, Machine Intelligence 3, volume 3, pages 131–171. Elsevier/North-Holland, Amsterdam, London, New York, 1968.
A. Bundy, F. Giunchiglia, A. Villafiorita, and T. Walsh. An Incompleteness Theorem via Abstraction. Journal of Automated Reasoning, 19(3):319–346, December 1997. Also IRST Technical Report 9302-15, irsT, Italy; DAI Research Paper, University of Edinburgh n. 809.
F. Giunchiglia. GETFOL Manual — GETFOL version 2.0. Technical Report 92-0010, DIST — University of Genoa, Genoa, Italy, March 1994.
F. Giunchiglia, A. Villafiorita, and T. Walsh. Theories of abstraction. AI Communications, 10:167–176, December 1997.
F. Giunchiglia and T. Walsh. A Theory of Abstraction. Artificial Intelligence, 57(2–3):323–390, 1992. Also IRST-Technical Report 9001-14, IRST, Trento, Italy.
F. Giunchiglia and T. Walsh. Tree subsumption: Reasoning with outlines. In Proc. 10th European Conference on Artificial Intelligence ECAI-92, pages 77–81, Vienna, Austria, 1992. Also IRST-Technical Report 9205-01, IRST, Trento, Italy.
Fausto Giunchiglia and Adolfo Villafiorita. ABSFOL: a Proof Checker with Abstraction. In Proceedings of the 13th Conference on Automated Deduction (CADE-13), pages 136–140. Springer, 1996. Also IRST-Technical Report 9602-20, IRST, Italy.
John McCarthy. Elaboration tolerance. In Fourth Symposium On Logical Formalizations of Commonsense Reasoning (Common Sense '98), Queen Mary and Westfield College, University of London, London, U.K., January 1998. Available at http://www-formal.stanford.edu/jmc/elaboration.html.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Villafiorita, A. (1998). Abstraction as a form of elaboration tolerance. In: Giunchiglia, F. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 1998. Lecture Notes in Computer Science, vol 1480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057464
Download citation
DOI: https://doi.org/10.1007/BFb0057464
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64993-9
Online ISBN: 978-3-540-49793-6
eBook Packages: Springer Book Archive