Query Evaluation and Progression in AOL Knowledge Bases
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 124-130.
Abstract
Recently Lakemeyer and Levesque proposed the logic AO £, which amalgamates both the situation calculus and Levesque's 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 AO £ 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.
@inproceedings{ijcai1999p19,
title = {Query Evaluation and Progression in AOL Knowledge Bases},
author = {Lakemeyer, Gerhard and Levesque, Hector J.},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {124--130},
year = {1999},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1999/19},
}
TY - CPAPER TI - Query Evaluation and Progression in AOL Knowledge Bases AU - Lakemeyer, Gerhard AU - Levesque, Hector J. T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 124 EP - 130 UR - https://ijcai.org/proceedings/1999/19 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
