Skip to Main content Skip to Navigation
Conference papers

Explicit Representations of Persistency for Propositional Action Theories

Sergej Scheck 1 Alexandre Niveau 1 Bruno Zanuttini 1 
1 Equipe MAD - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
Abstract : We consider enriching the representation of actions in propositional logic by syntactic operators for representing the persistency of variables. This is motivated by the fact that the frame problem is not satisfactorily solved by propositional languages, such as binary decision diagrams or DNF. We introduce two such operators, allowing to represent different kinds of persistency, and consider the languages obtained from propositional logic by adding them at any level of nesting. We study the resulting languages from the point of view of their relative succinctness and the complexity of deciding successorship. We show an interesting picture of diverse complexity results.
Document type :
Conference papers
Complete list of metadata
Contributor : Bruno Zanuttini Connect in order to contact the contributor
Submitted on : Thursday, June 3, 2021 - 10:57:50 PM
Last modification on : Saturday, June 25, 2022 - 9:56:44 AM
Long-term archiving on: : Saturday, September 4, 2021 - 7:54:06 PM


Files produced by the author(s)


  • HAL Id : hal-03249121, version 1


Sergej Scheck, Alexandre Niveau, Bruno Zanuttini. Explicit Representations of Persistency for Propositional Action Theories. Journées Francophones Francophones Planification, Décision et Apprentissage, Jun 2021, Bordeaux, France. ⟨hal-03249121⟩



Record views


Files downloads