Query evaluation and progression in AOL knowledge bases

Authors:
Gerhard Lakemeyer;Hector J. Levesque
Affiliations:
Depatment of Computer Science, Aachen University of Technology, Aachen, Germany;Department of Computer Science, University of Toronto, Toronto, Ontario, Canada
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Year:
1999

Citing 6
Cited 0

Foundations of a functional approach to knowledge representation.

Artificial Intelligence
All I know: a study in autoepistemic logic

Artificial Intelligence
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
How to progress a database

Artificial Intelligence
The logic of knowledge bases

The logic of knowledge bases
What is planning in the presence of sensing?

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently Lakemeyer and Levesque proposed the logic AOC, which amalgamates both the situation calculus and Levesques logic of only knowing. While very expressive the practical relevance of the formalism is unclear because it heavily relies on second-order logic. In this paper we demonstrate that the picture is not as bleak as it may seem. In particular, we show that for large classes of AOL knowledge bases and queries, including epistemic ones, query evaluation requires first-order reasoning only. We also provide a simple semantic definition of progressing a knowledge base. For a particular class of knowledge bases, adapted from earlier results by Lin and Reiter, we show that progression is first-order representable and easy to compute.