Abstract
We consider entailment problems in the fluent calculus as they arise in reasoning about actions. Taking into account various fragments of the fluent calculus we formally show decidability results, establish their complexity, and prove undecidability results. Thus we draw a boundary between decidable and undecidable fragments of the fluent calculus.
Cite
CITATION STYLE
Hölldobler, S., & Kuske, D. (2000). The boundary between decidable and undecidable fragments of the fluent calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1955, pp. 436–450). Springer Verlag. https://doi.org/10.1007/3-540-44404-1_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
