Article

Efficient Reasoning Using the Local Closed-World Assumption

Authors:

Patrick Doherty,

Witold Lukaszewicz,

Andrzej SzalasAuthors Info & Claims

AIMSA '00: Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications

Pages 49 - 58

Published: 20 September 2000 Publication History

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 approach 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 quantifier elimination, and the inference method itself, have polynomial time and space complexity.

References

[1]

S. Abiteboul, R. Hull, V. Vianu. Foundations of Databases, Addison-Wesley Pub. Co., 1996.

[2]

W. Ackermann. Untersuchungen über das Eliminationsproblem der mathematischen Logik, Mathematische Annalen, 110, 390-413, 1935.

[3]

T. Babaian, J. G. Schmolze. PSIPLAN: Planning with ψ-forms over Partially Closed Worlds, Technical Report.

[4]

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.

[5]

P. Doherty, W. Ł;ukaszewicz, A. Szałas. A Reduction Result for Circumscribed Semi-Horn Formulas, Fundamenta Informaticae, 28, 3-4, 261-271, 1996.

[6]

P. Doherty, W. Łukaszewicz, A. Szałas. Computing Circumscription Revisited. A Reduction Algorithm., Journal of Automated Reasoning, 18, 3, 297-336, 1997.

[7]

P. Doherty, W. Łukaszewicz, A. Szałas. General Domain Circumscription and its Effective Reductions, Fundamenta Informaticae, 36, 1, 23-55, 1998.

[8]

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.

[9]

O. Etzioni, K. Golden, D. S. Weld. Sound and Efficient Closed-World Reasoning for Planning. Artificial Intelligence, 89, 113-148, 1997.

[10]

M. Friedman, D. Weld. Efficiently Executing Information Gathering Plans, IJCAI-97.

[11]

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.

[12]

N. Immerman. Relational Queries Computable in Polynomial Time, Information and Control, 68, 86-104, 1986.

[13]

W. Łukaszewicz. (1990) Non-Monotonic Reasoning - Formalization of Commonsense Reasoning, Ellis Horwood Series in Artificial Intelligence. Ellis Horwood, 1990.

[14]

A. Nonnengart, H. J. Ohlbach, A. Szałas. 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.

[15]

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.

[16]

R. Reiter. On Closed World Databases, in: Logic and Databases, H. Gallaire and J. Minker (eds.), Plenum Press, New York, 55-76, 1978.

Cited By

Lamy J(2017)OwlreadyArtificial Intelligence in Medicine10.1016/j.artmed.2017.07.00280:C(11-28)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1016/j.artmed.2017.07.002
Lützenberger MKüster TMasuch NFähndrich JJonker CMarsella SThangarajah JTuyls K(2016)Multi-Agent System in PracticeProceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems10.5555/2936924.2937041(796-805)Online publication date: 9-May-2016
https://dl.acm.org/doi/10.5555/2936924.2937041
Ma$#322;uszy$#324;ski JSza$#322;as A(2010)Living with inconsistency and taming nonmonotonicityProceedings of the First international conference on Datalog Reloaded10.1007/978-3-642-24206-9_22(384-398)Online publication date: 16-Mar-2010
https://dl.acm.org/doi/10.1007/978-3-642-24206-9_22
Show More Cited By

Index Terms

Efficient Reasoning Using the Local Closed-World Assumption
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Probabilistic reasoning
      2. Vagueness and fuzzy logic
  2. Machine learning
    1. Machine learning approaches
      1. Rule learning
2. Theory of computation
  1. Design and analysis of algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Inductive inference

Recommendations

Closed world assumption for disjunctive reasoning
Abstract
In this paper, the relationship between argumentation and closed world reasoning for disjunctive information is studied. In particular, the authors propose a simple and intuitive generalization of the closed world assumption (CWA) for general ...
Reasoning about Web Services with Local Closed World Assumption
WI-IAT '09: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01

This paper presents a formalism for representing and reasoning about Web services with local closed world assumption (LCWA) on the basis of $\mathcal{ALCO@K}$. In our formalism, the knowledge about the states of the world is encoded in $\mathcal {ALCO@}$...
Evaluation of Queries under Closed-World Assumption

The minimal entailment ⊢Min has been characterized elsewhere by
P ⊢Min} φ iff Cn(P ∪ {φ}) ∩ Pos ⊆ Cn(P)
where Cn is the first-order consequence operation, P is a set of clauses (indefinite deductive data base; in short: a data base), φ is a clause (a ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

AIMSA '00: Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications

September 2000

363 pages

ISBN:3540410449

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 September 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lamy J(2017)OwlreadyArtificial Intelligence in Medicine10.1016/j.artmed.2017.07.00280:C(11-28)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1016/j.artmed.2017.07.002
Lützenberger MKüster TMasuch NFähndrich JJonker CMarsella SThangarajah JTuyls K(2016)Multi-Agent System in PracticeProceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems10.5555/2936924.2937041(796-805)Online publication date: 9-May-2016
https://dl.acm.org/doi/10.5555/2936924.2937041
Ma$#322;uszy$#324;ski JSza$#322;as A(2010)Living with inconsistency and taming nonmonotonicityProceedings of the First international conference on Datalog Reloaded10.1007/978-3-642-24206-9_22(384-398)Online publication date: 16-Mar-2010
https://dl.acm.org/doi/10.1007/978-3-642-24206-9_22
Cortés-Calabuig ÁDenecker MArieli OBruynooghe M(2008)Accuracy and efficiency of fixpoint methods for approximate query answering in locally complete databasesProceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031661.3031673(81-91)Online publication date: 16-Sep-2008
https://dl.acm.org/doi/10.5555/3031661.3031673
Denecker MCortés-Calabuig ÁBruynooghes MArieli O(2008)Towards a logical reconstruction of a theory for locally closed databasesACM Transactions on Database Systems (TODS)10.1145/1806907.180691435:3(1-60)Online publication date: 30-Jul-2008
https://dl.acm.org/doi/10.1145/1806907.1806914
Cortés-Calabuig ADenecker MArieli OVan Nuffelen BBruynooghe M(2005)On the local closed-world assumption of data-sourcesProceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning10.1007/11546207_12(145-157)Online publication date: 5-Sep-2005
https://dl.acm.org/doi/10.1007/11546207_12

View Options

View options

Figures

Tables

Media

View Table of Conten