Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CSL
2005
Springer

favoriteEmaildiscussreport

110views Automated Reasoning» more CSL 2005»

The Complexity of Independence-Friendly Fixpoint Logic

13 years 11 months ago

The Complexity of Independence-Friendly Fixpoint Logic

Download web.comlab.ox.ac.uk

We study the complexity of model-checking for the ﬁxpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedding PFP, we show that its combined complexity is ExpSpace-hard, and moreover the logic includes second order logic (on ﬁnite structures).

Julian C. Bradfield, Stephan Kreutzer

Real-time Traffic

CSL 2005 | Logic Captures Exptime | Order Logic | Sandu’s Independence-friendly Logic |

claim paper

Related Content

» Fixpoint Logics over Hierarchical Structures

» The Complexity of Model Checking Higher Order Fixpoint Logic

» Three notes on the complexity of model checking fixpoint logic with chop

» The Complexity of Model Checking HigherOrder Fixpoint Logic

» Propositional dynamic logic of contextfree programs and fixpoint logic with chop

» Fixpoint Extensions of Temporal Description Logics

» Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm

» Fixpoint Logics on Hierarchical Structures

» Improving the Alternating Fixpoint The Transformation Approach

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CSL
Authors	Julian C. Bradfield, Stephan Kreutzer

Comments (0)