Finite satisfiability for guarded fixpoint logic

Authors:
Vince Bárány;Mikołaj Bojańczyk
Affiliations:
Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland;Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland
Venue:
Information Processing Letters
Year:
2012

Back and forth between guarded and modal logics

ACM Transactions on Computational Logic (TOCL)
Two-Way Alternating Automata and Finite Models

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Guarded Fixed Point Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Querying the Guarded Fragment

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science

Hi-index	0.89

The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).