LiU Electronic Press
Full-text not available in DiVA
Author:
Doherty, Patrick (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Lukaszewicz, Witold (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Szalas, Andrzej (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Title:
Explaining explanation closure
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems,1996
Editor:
Zbigniew W. Ras, Maciek Michalewicz
Publisher: Springer Berlin/Heidelberg
Series:
Lecture Notes in Computer Science, ISSN 0302-9743; 1079
Pages:
521-530
Year of publ.:
1996
URI:
urn:nbn:se:liu:diva-41450
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-41450
ISBN:
3-540-61286-6
Local ID:
56675
Subject category:
Computer Science
SVEP category:
Computer science
Abstract(en) :

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.

Available from:
2009-10-10
Created:
2009-10-10
Last updated:
2012-02-13
Statistics:
6 hits