Efficient reasoning using the local closed-world assumption
Doherty, Patrick Lukaszewicz, Witold Szalas, Andrzej 2000 (English)In: Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA), Springer Berlin/Heidelberg, 2000, 49-58Conference paper (Refereed)
We present a sound and complete, tractable inference method for reasoning with localized closed world assumptions (LCWA’s) which can be used in applications where a reasoning or planning agent can not assume complete information about planning or reasoning states. This Open World Assumption is generally necessary in most realistic robotics applications. The inference procedure subsumes that described in Etzioni et al , and others. In addition, it provides a great deal more expressivity, permitting limited use of negation and disjunction in the representation of LCWA’s, while still retaining tractability. The ap- proach is based on the use of circumscription and quantifier elimination techniques and inference is viewed as querying a deductive database. Both the preprocessing of the database using circumscription and quan- tifier elimination, and the inference method itself, have polynomial time and space complexity.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 1904
National CategoryComputer Science
IdentifiersURN: urn:nbn:se:liu:diva-41590DOI: 10.1007/3-540-45331-8_5Local ID: 58057ISBN: 978-3-540-41044-7 (print)ISBN: 978-3-540-45331-4 (online)OAI: oai:DiVA.org:liu-41590DiVA: diva2:262444
9th International Conference, AIMSA 2000, Varna, Bulgaria, September 20–23, 2000