Relational queries computable in polynomial time
Information and Control
A reduction result for circumscribed semi-Horn formulas
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Sound and efficient closed-world reasoning for planning
Artificial Intelligence
General domain circumscription and its effective reductions
Fundamenta Informaticae
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computing Circumscription Revisited: A Reduction Algorithm
Journal of Automated Reasoning
Second-Order Quantifier Elimination in Modal Contexts
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Towards a logical reconstruction of a theory for locally closed databases
ACM Transactions on Database Systems (TODS)
Semantic web reasoning using a blackboard system
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
On the local closed-world assumption of data-sources
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Representation of partial knowledge and query answering in locally complete databases
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Living with inconsistency and taming nonmonotonicity
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
| Hi-index | 0.00 |
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.