Finite Satisfiability of Unary Negation Fragment with Transitivity (Extended Abstract)

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require that some binary symbols are interpreted as arbitrary transitive relations, some as partial orders and some as equivalences. We also consider finite satisfiability of various extensions of our primary logic, in particular capturing the concepts of nominals and role hierarchies known from description logic. As the unary negation fragment can express unions of conjunctive queries our results have interesting implications for the problem of finite query answering, both in the classical scenario and in the description logics setting.

[1]  Martin Otto,et al.  Undecidability Results on Two-Variable Logics , 1997, STACS.

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Lauri Hella,et al.  One-dimensional Fragment of First-order Logic , 2014, Advances in Modal Logic.

[4]  Emanuel Kieronski.  On the complexity of the two-variable guarded fragment with transitive guards , 2006, Inf. Comput..

[5]  Yevgeny Kazakov,et al.  RIQ and SROIQ Are Harder than SHOIQ , 2008, KR.

[6]  Lidia Tendera,et al.  The Fluted Fragment with Transitivity , 2019, MFCS.

[7]  Lidia Tendera,et al.  Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants , 2018, ACM Trans. Comput. Log..

[8]  Wieslaw Szwast,et al.  The guarded fragment with transitive guards , 2004, Ann. Pure Appl. Log..

[9]  Balder ten Cate,et al.  Guarded Negation , 2011, Advances in Modal Logic.

[10]  Michael Benedikt,et al.  Query Answering with Transitive and Linear-Ordered Data , 2016, IJCAI.

[11]  Saturation-based decision procedures for extensions of the guarded fragment , 2006 .

[12]  Balder ten Cate,et al.  Unary negation , 2013, Log. Methods Comput. Sci..

[13]  Yevgeny Kazakov,et al.  Role Conjunctions in Expressive Description Logics , 2008, LPAR.

[14]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[15]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[16]  John M. Hems.  The Limits of Decision , 1971 .

[17]  Jean Christoph Jung,et al.  Querying the Unary Negation Fragment with Regular Path Expressions , 2018, ICDT.

[18]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

[19]  Filip Murlak,et al.  Finite Query Answering in Expressive Description Logics with Transitive Roles , 2018, KR.

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

[21]  Jean-François Baget,et al.  Walking the Decidability Line for Rules with Existential Variables , 2010, KR.

[22]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[23]  Emanuel Kieronski,et al.  Unary negation fragment with equivalence relations has the finite model property , 2018, LICS.

[24]  Ian Horrocks,et al.  A Tableaux Decision Procedure for SHOIQ , 2005, IJCAI.

[25]  Wieslaw Szwast,et al.  Quine's Fluted Fragment Revisited , 2019, J. Symb. Log..

[26]  Margus Veanes,et al.  The two-variable guarded fragment with transitive relations , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[27]  Ian Pratt-Hartmann.  The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable , 2017, ArXiv.

[28]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[29]  Emanuel Kieronski,et al.  Results on the Guarded Fragment with Equivalence or Transitive Relations , 2005, CSL.

[30]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[31]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.