A Step Up in Expressiveness of Decidable Fixpoint Logics - Archive ouverte HAL Access content directly
Conference Papers Year :

A Step Up in Expressiveness of Decidable Fixpoint Logics

(1) , (2) , (1)
1
2

Abstract

Guardedness restrictions are one of the principal means to obtain decidable logics — operators such as negation are restricted so that the free variables are contained in an atom. While guardedness has been applied fruitfully in the setting of first-order logic, the ability to add fixpoints while retaining decidability has been very limited. Here we show that one of the main restrictions imposed in the past can be lifted, getting a richer decidable logic by allowing fixpoints in which the parameters of the fixpoint can be unguarded. Using automata, we show that the resulting logics have a decidable satisfiability problem, and provide a fine study of the complexity of satisfiability. We show that similar methods apply to decide questions concerning the elimination of fixpoints within formulas of the logic.
Fichier principal
Vignette du fichier
LICS16-gnfpup-long.pdf (439.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01413890 , version 1 (09-04-2017)

Identifiers

  • HAL Id : hal-01413890 , version 1

Cite

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. A Step Up in Expressiveness of Decidable Fixpoint Logics. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. ⟨hal-01413890⟩
90 View
156 Download

Share

Gmail Facebook Twitter LinkedIn More