Abstract
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 [9], 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.
The authors are supported in part by a basic research grant from the Wallenberg Foundation, Sweden.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, R. Hull. V. Vianu. Foundations of Databases, Addison-Wesley Pub. Co., 1996.
W. Ackermann. Untersuchungen über das Eliminationsproblem der mathematischen Logik, Mathematische Annalen, 110, 390–413, 1935.
T. Babaian, J. G. Schmolze. PSIPLAN: Planning with ψ-forms over Partially Closed Worlds, Technical Report.
T. Babaian, J: G. Schmolze. PSIPLAN: Open World Planning with ψ-forms, Proceedings of the 5th Int’l Conference on Artificial Intelligence and Planning (AIPS 2000), 2000.
P. Doherty, W. Łukaszewicz, A. SzaFlas. A Reduction Result for Circumscribed SemiHorn Formulas, Fundamenta Informaticae, 28, 3–4, 261–271, 1996.
P. Doherty, W. Łukaszewicz, A. Szałas. Computing Circumscription Revisited. A Reduction Algorithm., Journal of Automated Reasoning, 18,3, 297–336, 1997.
P. Doherty, W. Łukaszewicz, A. Szałas. General Domain Circumscription and its Effective Reductions, Fundamenta Informaticae, 36,1, 23–55, 1998.
P. Doherty, W. Łukaszewicz, A. Szałas. Declarative PTIME Queries for Relational Databases using Quantifier Elimination, Journal of Logic and Computation, 9,5, 739–761, 1999. 54, 55, 56
O. Etzioni, K. Golden, D. S. Weld. Sound and Efficient Closed-World Reasoning for Planning. Artificial Intelligence, 89, 113–148, 1997.
M. Friedman, D. Weld. Efficiently Executing Information Gathering Plans, IJCAI-97.
J. Gustafsson. An Implementation and Optimization of an Algorithm for Reducing Formulae in Second-Order Logic, Technical Report LiTH-Mat-Ex-96-04, Linköping University, 1996.
N. Immerman. Relational Queries Computable in Polynomial Time, Information and Control, 68, 86–104, 1986.
W. Łukaszewicz. (1990) Non-Monotonic Reasoning-Formalization of Commonsense Reasoning, Ellis Horwood Series in Artificial Intelligence. Ellis Horwood, 1990.
A. Nonnengart, H. J. Ohlbach, A. SzaFlas. Elimination of Predicate Quantifiers, In: Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, H. J. Ohlbach and U. Reyle (eds.), Kluwer, 159–181, 1999.
A. Nonnengart, A. Szałas. A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory, In: Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, E. Orlowska (ed.), Physica Verlag, 89–108, 1998.
R. Reiter. On Closed World Databases, in:Logic and Databases, H. Gallaire and J. Minker (eds.), Plenum Press, New York, 55–76, 1978.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doherty, P., Lukaszewicz, W., Szalas, A. (2000). Efficient Reasoning Using the Local Closed-World Assumption. In: Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2000. Lecture Notes in Computer Science, vol 1904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45331-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-45331-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41044-7
Online ISBN: 978-3-540-45331-4
eBook Packages: Springer Book Archive