{"type":"ScholarlyArticle","title":"A Simple Formalization of Actions Using Circumscription","authors":[{"name":"G. Neelakantan Kartha","slug":"g-neelakantan-kartha","given":"G. Neelakantan","family":"Kartha","affiliation":""},{"name":"Vladimir Lifschitz","slug":"vladimir-lifschitz","given":"Vladimir","family":"Lifschitz","affiliation":""}],"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 th e use of the formalism of nested abnormality theories.","doi":null,"url":"https://ijcai.org/proceedings/1995/253","pdf":"https://ijcai.org/proceedings/1995/0253.pdf","markdown":"https://ijcai.org/proceedings/1995/253.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/253","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Temporal Reasoning","track":"Temporal Reasoning","number":253,"pages":{"first":1970,"last":1976},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}