A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
Abstract
The study of situated systems that are capable of reactive and goal-directed behaviour has received increased attention in recent years. One approach to the design of such systems is based upon agent-oriented architectures. This approach has led to the development of expressive, but computationally intractable, logics for describing or specifying the behaviours of agent-oriented systems. In this paper, we present three propositional variants of such logics, with different expressive power, and analyze the computational complexity of verifying if a given property is satisfied by a given abstract agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the practical use of such logics for verifying agent-oriented systems.
Cite
Text
Rao and Georgeff. "A Model-Theoretic Approach to the Verification of Situated Reasoning Systems." International Joint Conference on Artificial Intelligence, 1993.Markdown
[Rao and Georgeff. "A Model-Theoretic Approach to the Verification of Situated Reasoning Systems." International Joint Conference on Artificial Intelligence, 1993.](https://mlanthology.org/ijcai/1993/rao1993ijcai-model/)BibTeX
@inproceedings{rao1993ijcai-model,
title = {{A Model-Theoretic Approach to the Verification of Situated Reasoning Systems}},
author = {Rao, Anand S. and Georgeff, Michael P.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1993},
pages = {318-324},
url = {https://mlanthology.org/ijcai/1993/rao1993ijcai-model/}
}