Finite Satisfiability for Guarded Fixpoint Logic

Details Finite Satisfiability for Guarded Fixpoint Logic Finite Satisfiability for Guarded Fixpoint Logic

2011-04-12

arxiv.org/abs/1104.2262v3

Computer Science

Logic in Computer Science

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Finite Satisfiability for Guarded Fixpoint Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite Satisfiability for Guarded Fixpoint Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite Satisfiability for Guarded Fixpoint Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-731105