Situation Calculus as Answer Set Programming
Abstract
We show how the situation calculus can be reformulated in terms of the first-order stable model semantics. A further transformation into answer set programs allows us to use an answer set solver to perform propositional reasoning about the situation calculus. We also provide an ASP style encoding method for Reiter's basic action theories, which tells us how the solution to the frame problem in ASP is related to the solution in the situation calculus.
Cite
Text
Lee and Palla. "Situation Calculus as Answer Set Programming." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7601Markdown
[Lee and Palla. "Situation Calculus as Answer Set Programming." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/lee2010aaai-situation/) doi:10.1609/AAAI.V24I1.7601BibTeX
@inproceedings{lee2010aaai-situation,
title = {{Situation Calculus as Answer Set Programming}},
author = {Lee, Joohyung and Palla, Ravi},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2010},
pages = {309-314},
doi = {10.1609/AAAI.V24I1.7601},
url = {https://mlanthology.org/aaai/2010/lee2010aaai-situation/}
}