Finite satisfiability for guarded fixpoint logic
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTIME (resp. ExpTIME for formulas of bounded width). (C) 2012 Elsevier B.V. All rights reserved.
finite satisfiability guarded fixpoint logic formal methods guarded fragment