Explaining explanation closure
Doherty, Patrick Lukaszewicz, Witold Szalas, Andrzej 1996 (English)In: Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems,1996 / [ed] Zbigniew W. Ras, Maciek Michalewicz, Springer Berlin/Heidelberg, 1996, 521-530Conference paper (Refereed)
Recently, Haas, Schubert, and Reiter, have developed an alternative approach to the frame problem which is based on the idea of using explanation closure axioms. The claim is that there is a monotonic solution for characterizing nonchange in serial worlds with fully specified actions, where one can have both a succinct representation of frame axioms and an effective proof theory for the characterization. In the paper, we propose a circumscriptive version of explanation closure, PMON, that has an effective proof theory and works for both context dependent and nondeterministic actions. The approach retains representational succinctness and a large degree of elaboration tolerance, since the process of generating closure axioms is fully automated and is of no concern to the knowledge engineer. In addition, we argue that the monotonic/nonmonotonic dichotomy proposed by others is not as sharp as previously claimed and is not fully justified.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 1079
National CategoryComputer Science
IdentifiersURN: urn:nbn:se:liu:diva-41450DOI: 10.1007/3-540-61286-6_176Local ID: 56675ISBN: 3-540-61286-6OAI: oai:DiVA.org:liu-41450DiVA: diva2:262302