{"type":"ScholarlyArticle","title":"Reasoning about Action in Polynomial Time","authors":[{"name":"Thomas Drakengren","slug":"thomas-drakengren","given":"Thomas","family":"Drakengren","affiliation":""},{"name":"Marcus Bjäreland","slug":"marcus-bjareland","given":"Marcus","family":"Bjäreland","affiliation":""}],"abstract":"Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this paper are the following: a temporal logic with a restriction for which deciding satisfiability is tractable, a tractable extension for reasoning about action, and NP-completeness results for the unrestricted problems. Many interesting reasoning problems can be modelled, involving nondeterminism, concurrency and memory of actions. The reasoning process is proved to be sound and complete.","doi":null,"url":"https://ijcai.org/proceedings/1997/208","pdf":"https://ijcai.org/proceedings/1997/0208.pdf","markdown":"https://ijcai.org/proceedings/1997/208.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/208","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Temporal Reasoning","track":"Temporal Reasoning","number":208,"pages":{"first":1447,"last":1452},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}