Reasoning about action in polynomial time
✍ Scribed by Thomas Drakengren; Marcus Bjäreland
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 196 KB
- Volume
- 115
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
✦ Synopsis
Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this article 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.
📜 SIMILAR VOLUMES
The automation of reasoning about the consequences of actions has been viewed as an important problem since the early days of Artificial Intelligence. Logic programming turned out to be an excellent tool for describing actions and their effects. The use of negation as failure leads to a simple solut
In order to enable the database programmer to reason about relations over strings of arbitrary length, we introduce alignment calculus, a modal extension of the relational calculus. In addition to relations, a state in the model consists of a two-dimensional array where the strings are aligned on to
This case study illustrates instruction in an urban 6th-grade classroom in which students were learning about mass, volume, and density by attempting to layer (stack) three miscible solutions with differing densities atop one another. The study examines classroom discourse and interaction on the bas