Decidability Results for the Propositional Fluent Calculus
- 15 December 2000
- book chapter
- Published by Springer Nature
- p. 762-776
- https://doi.org/10.1007/3-540-44957-4_51
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the decidability of model checking for several μ-calculi and Petri netsPublished by Springer Nature ,2005
- Some contributions to the metatheory of the situation calculusJournal of the ACM, 1999
- Decidability of model checking for infinite-state concurrent systemsActa Informatica, 1997
- Computing change and specificity with equational logic programsAnnals of Mathematics and Artificial Intelligence, 1995
- The minimal coverability graph for Petri netsPublished by Springer Nature ,1993
- Modal and Temporal LogicsPublished by Oxford University Press (OUP) ,1992
- A new deductive approach to planningNew Generation Computing, 1990
- Branching time temporal logicPublished by Springer Nature ,1989
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- Deciding full branching time logicInformation and Control, 1984