Initial limit Datalog: a new extensible class of decidable constrained Horn clauses

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 Datalog Z (a fragment of Da...

Descripció completa

Dades bibliogràfiques
Autors principals:	Cathcart Burn, T, Ong, C-H, Ramsay, S, Wagner, D
Format:	Conference item
Idioma:	English
Publicat:	IEEE 2021

Ítems similars

Higher-order constrained horn clauses for verification
per: Cathcart Burn, T, et al.
Publicat: (2017)

Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
per: Cuenca Grau, B, et al.
Publicat: (2016)

Computing Datalog Rewritings Beyond Horn Ontologies
per: Grau, B, et al.
Publicat: (2013)

Datalog rewriting techniques for non-Horn ontologies
per: Kaminski, M, et al.
Publicat: (2014)

Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions
per: Qi Zhou, et al.
Publicat: (2018-09-01)

Higher-order constrained Horn clauses for higher-order program verification
per: Jochems, J
Publicat: (2020)

Solving non-linear Horn clauses using a linear Horn clause solver
per: Bishoksan Kafle, et al.
Publicat: (2016-07-01)

Datalog and its extensions for the semantic web
per: Gottlob, G, et al.
Publicat: (2012)

The complexity and expressive power of limit Datalog
per: Kaminski, M, et al.
Publicat: (2021)

Stratified negation in limit datalog programs
per: Kaminski, M, et al.
Publicat: (2018)

On the decidability of finite extensions of decidable fields
per: Thanagopal, K
Publicat: (2018)

Decomposition by tree dimension in Horn clause verification
per: Bishoksan Kafle, et al.
Publicat: (2015-12-01)

Hierarchical State Machines as Modular Horn Clauses
per: Pierre-Loïc Garoche, et al.
Publicat: (2016-07-01)

Decidability in extensions of Fp((t))
per: Rigler, B
Publicat: (2021)

Deciding floating−point logic with abstract conflict driven clause learning
per: Brain, M, et al.
Publicat: (2013)

Deciding floating-point logic with abstract conflict driven clause learning
per: Brain, M, et al.
Publicat: (2014)

$n$-permutability and linear Datalog implies symmetric Datalog
per: Alexandr Kazda
Publicat: (2018-04-01)

Monadic datalog, tree validity, and limited access containment
per: Benedikt, M, et al.
Publicat: (2019)

Complexity and expressive power of disjunction and negation in limit datalog
per: Kaminski, M, et al.
Publicat: (2020)

Lemma Generation for Horn Clause Satisfiability: A Preliminary Study
per: Emanuele De Angelis, et al.
Publicat: (2019-08-01)

Removing Unnecessary Variables from Horn Clause Verification Conditions
per: Emanuele De Angelis, et al.
Publicat: (2016-07-01)

Disjunctive Datalog
per: Eiter, T, et al.
Publicat: (1997)

Foundations of Declarative Data Analysis Using Limit Datalog Programs
per: Kaminski, M, et al.
Publicat: (2017)

Limit Datalog: A declarative query language for data analysis
per: Grau, BC, et al.
Publicat: (2020)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
per: Kaminski, M, et al.
Publicat: (2014)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
per: Kaminski, M, et al.
Publicat: (2014)

Towards Coinductive Theory Exploration in Horn Clause Logic: Position Paper
per: Ekaterina Komendantskaya Dr, et al.
Publicat: (2018-09-01)

Datalog+⁄−: Questions and Answers
per: Gottlob, G, et al.
Publicat: (2014)

Monadic Datalog Containment
per: Benedikt, M, et al.
Publicat: (2012)

On Datalog vs. LFP
per: Dawar, A, et al.
Publicat: (2008)

Adding Disjunction to Datalog
per: Eiter, T, et al.
Publicat: (1994)

Monadic Datalog Containment
per: Benedikt, M, et al.
Publicat: (2012)

Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
per: Emanuele De Angelis, et al.
Publicat: (2019-07-01)

RDFLog: It's like Datalog for RDF
per: Bry, F, et al.
Publicat: (2008)

Maintenance of datalog materialisations revisited
per: Motik, B, et al.
Publicat: (2019)

Inconsistency Handling in Datalog+⁄− Ontologies
per: Lukasiewicz, T, et al.
Publicat: (2012)

Declarative probabilistic programming with datalog
per: Barany, V, et al.
Publicat: (2016)