Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses

We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types) of the first-order language limit DatalogZ (a fragment of Datalog modulo linear integer arithmetic), but can be instantiated with any suitable background theory. For example, the fragment is decidable over any countable well-quasi-order with a decidable first-order theory, such as natural number vectors under componentwise linear arithmetic, and words of a bounded, context-free language ordered by the subword relation. Formulas of initial limit Datalog have the property that, under some assumptions on the background theory, their satisfiability can be witnessed by a new kind of term model which we call entwined structures. Whilst the set of all models is typically uncountable, the set of all entwined structures is recursively enumerable, and model checking is decidable.

[1]  Philippe Schnoebelen,et al.  Decidability, complexity, and expressiveness of first-order logic over the subword ordering , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[2]  M. Rabin Decidability of second-order theories and automata on infinite trees , 1968 .

[3]  William W. Wadge,et al.  Extensional Higher-Order Logic Programming , 2013, TOCL.

[4]  Joseph M. Hellerstein,et al.  Boom analytics: exploring data-centric, declarative programming for the cloud , 2010, EuroSys '10.

[5]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[6]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[7]  A. To Model Checking Infinite-State Systems: Generic and Specific Approaches , 2010 .

[8]  Georg Zetzsche,et al.  Languages ordered by the subword order , 2019, FoSSaCS.

[9]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[10]  Mahesh Viswanathan,et al.  A Decidable Fragment of Second Order Logic With Applications to Synthesis , 2017, CSL.

[11]  C.-H. Luke Ong,et al.  Higher-order constrained horn clauses for verification , 2018, Proc. ACM Program. Lang..

[12]  Nikolaj Bjørner,et al.  Horn Clause Solvers for Program Verification , 2015, Fields of Logic and Computation II.

[13]  Bernard R. Hodgson On Direct Products of Automaton Decidable Theories , 1982, Theor. Comput. Sci..

[14]  Panos Rondogiannis,et al.  The Expressive Power of Higher-Order Datalog , 2019, Theory Pract. Log. Program..

[15]  Kenneth McAloon,et al.  Computational complexity and constraint logic programming languages , 2005, Annals of Mathematics and Artificial Intelligence.

[16]  Ahmed Bouajjani,et al.  Model Checking Lossy Vector Addition Systems , 1999, STACS.

[17]  Richard Mayr,et al.  Undecidable problems in unreliable computations , 2000, Theor. Comput. Sci..

[18]  J. Barwise,et al.  Monadic Second-Order Theories , 2016 .

[19]  Boris Motik,et al.  Foundations of Declarative Data Analysis Using Limit Datalog Programs , 2017, IJCAI.

[20]  C.-H. Luke Ong,et al.  HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories , 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[21]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[22]  Naoki Kobayashi,et al.  Higher-Order Program Verification via HFL Model Checking , 2017, ESOP.

[23]  Harald Ganzinger,et al.  Refutational theorem proving for hierarchic first-order theories , 1994, Applicable Algebra in Engineering, Communication and Computing.

[24]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[25]  Vince Bárány,et al.  Automatic presentations of infinite structures , 2007 .

[26]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..