Definability and Interpolation within Decidable Fixpoint Logics

We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as well as effective characterizations. Our algorithms revolve around a finer analysis of the tree-model property and a refinement of the method of moving back and forth between relational logics and logics over trees.

[1]  Martin Otto,et al.  The Freedoms of (Guarded) Bisimulation , 2014, Johan van Benthem on Logic and Information Dynamics.

[2]  Georg Gottlob,et al.  Querying the Guarded Fragment , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[3]  Thomas Place,et al.  Characterization of Logics over Ranked Tree Languages , 2008, CSL.

[4]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[5]  Thomas Colcombet,et al.  The Complexity of Boundedness for Guarded Logics , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[6]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[7]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[8]  Michael Benedikt,et al.  Interpolation with Decidable Fixpoint Logics , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[9]  Anuj Dawar.  A Restricted Second Order Logic for Finite Structures , 1998, Inf. Comput..

[10]  Michael Benedikt,et al.  Effective Interpolation and Preservation in Guarded Logics , 2014, CSL-LICS.

[11]  Maarten Marx,et al.  Beth Definability for the Guarded Fragment , 1999, LPAR.

[12]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[13]  Giacomo Lenzi,et al.  Bisimulation quantifiers and uniform interpolation for guarded first order logic , 2015, Theor. Comput. Sci..

[14]  Michael Benedikt,et al.  A Step Up in Expressiveness of Decidable Fixpoint Logics , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[15]  Martin Otto,et al.  Back and forth between guarded and modal logics , 2002, TOCL.

[16]  Michael Benedikt,et al.  Characterizing Definability in Decidable Fixpoint Logics , 2017, ICALP.

[17]  Achim Blumensath,et al.  Decidability Results for the Boundedness Problem , 2014, Log. Methods Comput. Sci..

[18]  Georg Gottlob,et al.  Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2003, J. Comput. Syst. Sci..

[19]  Igor Walukiewicz,et al.  Automata for the Modal mu-Calculus and related Results , 1995, MFCS.

[20]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[21]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[22]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[23]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[24]  Georg Gottlob,et al.  Datalog LITE: a deductive query language with linear time model checking , 2002, TOCL.

[25]  Martin Otto.  Eliminating Recursion in the µ-Calculus , 1999, STACS.

[26]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[27]  Mikolaj Bojanczyk,et al.  Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets , 2012, ICALP.

[28]  Balder ten Cate,et al.  Queries with Guarded Negation , 2012, Proc. VLDB Endow..

[29]  Michael Benedikt,et al.  Rewriting Guarded Negation Queries , 2013, MFCS.

[30]  Diego Figueira,et al.  Semantically Acyclic Conjunctive Queries under Functional Dependencies , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[31]  Igor Walukiewicz,et al.  On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.

[32]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[33]  Georg Gottlob,et al.  Semantic Acyclicity Under Constraints , 2016, AMW.