Finite Satisfiability for Guarded Fixpoint Logic
arXiv:1104.2262
Abstract
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
arXiv:1104.2262
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).