Characterizing Definability in Decidable Fixpoint Logics

international colloquium on automata languages and programming, 2017.

Cited by: 8|Bibtex|Views7|Links
EI

Abstract:

We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as well as effective characterizations. Our algorithms revolve around a finer analysis of the tree-mod...More

Code:

Data:

Your rating :
0

 

Tags
Comments