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...

Полное описание

Библиографические подробности
Главные авторы:	Cathcart Burn, T, Ong, C-H, Ramsay, S, Wagner, D
Формат:	Conference item
Язык:	English
Опубликовано:	IEEE 2021

Схожие документы

Higher-order constrained horn clauses for verification
по: Cathcart Burn, T, и др.
Опубликовано: (2017)

Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
по: Cuenca Grau, B, и др.
Опубликовано: (2016)

Computing Datalog Rewritings Beyond Horn Ontologies
по: Grau, B, и др.
Опубликовано: (2013)

Datalog rewriting techniques for non-Horn ontologies
по: Kaminski, M, и др.
Опубликовано: (2014)

Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions
по: Qi Zhou, и др.
Опубликовано: (2018-09-01)

Higher-order constrained Horn clauses for higher-order program verification
по: Jochems, J
Опубликовано: (2020)

Solving non-linear Horn clauses using a linear Horn clause solver
по: Bishoksan Kafle, и др.
Опубликовано: (2016-07-01)

Datalog and its extensions for the semantic web
по: Gottlob, G, и др.
Опубликовано: (2012)

The complexity and expressive power of limit Datalog
по: Kaminski, M, и др.
Опубликовано: (2021)

Stratified negation in limit datalog programs
по: Kaminski, M, и др.
Опубликовано: (2018)

On the decidability of finite extensions of decidable fields
по: Thanagopal, K
Опубликовано: (2018)

Decomposition by tree dimension in Horn clause verification
по: Bishoksan Kafle, и др.
Опубликовано: (2015-12-01)

Hierarchical State Machines as Modular Horn Clauses
по: Pierre-Loïc Garoche, и др.
Опубликовано: (2016-07-01)

Decidability in extensions of Fp((t))
по: Rigler, B
Опубликовано: (2021)

Deciding floating−point logic with abstract conflict driven clause learning
по: Brain, M, и др.
Опубликовано: (2013)

Deciding floating-point logic with abstract conflict driven clause learning
по: Brain, M, и др.
Опубликовано: (2014)

$n$-permutability and linear Datalog implies symmetric Datalog
по: Alexandr Kazda
Опубликовано: (2018-04-01)

Monadic datalog, tree validity, and limited access containment
по: Benedikt, M, и др.
Опубликовано: (2019)

Complexity and expressive power of disjunction and negation in limit datalog
по: Kaminski, M, и др.
Опубликовано: (2020)

Lemma Generation for Horn Clause Satisfiability: A Preliminary Study
по: Emanuele De Angelis, и др.
Опубликовано: (2019-08-01)

Removing Unnecessary Variables from Horn Clause Verification Conditions
по: Emanuele De Angelis, и др.
Опубликовано: (2016-07-01)

Disjunctive Datalog
по: Eiter, T, и др.
Опубликовано: (1997)

Foundations of Declarative Data Analysis Using Limit Datalog Programs
по: Kaminski, M, и др.
Опубликовано: (2017)

Limit Datalog: A declarative query language for data analysis
по: Grau, BC, и др.
Опубликовано: (2020)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
по: Kaminski, M, и др.
Опубликовано: (2014)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
по: Kaminski, M, и др.
Опубликовано: (2014)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
по: Kaminski, M, и др.
Опубликовано: (2014)

Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
по: Kaminski, M, и др.
Опубликовано: (2014)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
по: Kaminski, M, и др.
Опубликовано: (2014)

Towards Coinductive Theory Exploration in Horn Clause Logic: Position Paper
по: Ekaterina Komendantskaya Dr, и др.
Опубликовано: (2018-09-01)

Datalog+⁄−: Questions and Answers
по: Gottlob, G, и др.
Опубликовано: (2014)

Monadic Datalog Containment
по: Benedikt, M, и др.
Опубликовано: (2012)

On Datalog vs. LFP
по: Dawar, A, и др.
Опубликовано: (2008)

Adding Disjunction to Datalog
по: Eiter, T, и др.
Опубликовано: (1994)

Monadic Datalog Containment
по: Benedikt, M, и др.
Опубликовано: (2012)

Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
по: Emanuele De Angelis, и др.
Опубликовано: (2019-07-01)

RDFLog: It's like Datalog for RDF
по: Bry, F, и др.
Опубликовано: (2008)

Maintenance of datalog materialisations revisited
по: Motik, B, и др.
Опубликовано: (2019)

Inconsistency Handling in Datalog+⁄− Ontologies
по: Lukasiewicz, T, и др.
Опубликовано: (2012)

Declarative probabilistic programming with datalog
по: Barany, V, и др.
Опубликовано: (2016)