ML Anthology

A Simple Formalization of Actions Using Circumscription

G. Neelakantan Kartha, Vladimir Lifschitz
IJCAI 1995 pp. 1970-1977
/ijcai/1995/kartha1995ijcai-simple/

Abstract

We present a simple circumscriptive method for formalizing actions with indirect effects (ramifications), and show that, in several examples, all second-order quantifiers can be eliminated from these formalizations using existing techniques for computing circumscriptions. One of the two symbolic computation methods employed here is a generalization of predicate completion and the other is based on the SCAN algorithm. The simplicity of our new approach to representing actions is due to the use of the formalism of nested abnormality theories. 1

PDF Semantic Scholar

Cite

Text

Kartha and Lifschitz. "A Simple Formalization of Actions Using Circumscription." International Joint Conference on Artificial Intelligence, 1995.

Markdown

[Kartha and Lifschitz. "A Simple Formalization of Actions Using Circumscription." International Joint Conference on Artificial Intelligence, 1995.](https://mlanthology.org/ijcai/1995/kartha1995ijcai-simple/)

BibTeX

@inproceedings{kartha1995ijcai-simple,
  title     = {{A Simple Formalization of Actions Using Circumscription}},
  author    = {Kartha, G. Neelakantan and Lifschitz, Vladimir},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1995},
  pages     = {1970-1977},
  url       = {https://mlanthology.org/ijcai/1995/kartha1995ijcai-simple/}
}