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

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Cathcart Burn, T, Ong, C-H, Ramsay, S, Wagner, D
Formáid:	Conference item
Teanga:	English
Foilsithe / Cruthaithe:	IEEE 2021

Míreanna comhchosúla

Higher-order constrained horn clauses for verification
de réir: Cathcart Burn, T, et al.
Foilsithe / Cruthaithe: (2017)

Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
de réir: Cuenca Grau, B, et al.
Foilsithe / Cruthaithe: (2016)

Computing Datalog Rewritings Beyond Horn Ontologies
de réir: Grau, B, et al.
Foilsithe / Cruthaithe: (2013)

Datalog rewriting techniques for non-Horn ontologies
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)

Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions
de réir: Qi Zhou, et al.
Foilsithe / Cruthaithe: (2018-09-01)

Higher-order constrained Horn clauses for higher-order program verification
de réir: Jochems, J
Foilsithe / Cruthaithe: (2020)

Solving non-linear Horn clauses using a linear Horn clause solver
de réir: Bishoksan Kafle, et al.
Foilsithe / Cruthaithe: (2016-07-01)

Datalog and its extensions for the semantic web
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2012)

The complexity and expressive power of limit Datalog
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2021)

Stratified negation in limit datalog programs
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2018)

On the decidability of finite extensions of decidable fields
de réir: Thanagopal, K
Foilsithe / Cruthaithe: (2018)

Decomposition by tree dimension in Horn clause verification
de réir: Bishoksan Kafle, et al.
Foilsithe / Cruthaithe: (2015-12-01)

Hierarchical State Machines as Modular Horn Clauses
de réir: Pierre-Loïc Garoche, et al.
Foilsithe / Cruthaithe: (2016-07-01)

Decidability in extensions of Fp((t))
de réir: Rigler, B
Foilsithe / Cruthaithe: (2021)

Deciding floating−point logic with abstract conflict driven clause learning
de réir: Brain, M, et al.
Foilsithe / Cruthaithe: (2013)

Deciding floating-point logic with abstract conflict driven clause learning
de réir: Brain, M, et al.
Foilsithe / Cruthaithe: (2014)

$n$-permutability and linear Datalog implies symmetric Datalog
de réir: Alexandr Kazda
Foilsithe / Cruthaithe: (2018-04-01)

Monadic datalog, tree validity, and limited access containment
de réir: Benedikt, M, et al.
Foilsithe / Cruthaithe: (2019)

Complexity and expressive power of disjunction and negation in limit datalog
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2020)

Lemma Generation for Horn Clause Satisfiability: A Preliminary Study
de réir: Emanuele De Angelis, et al.
Foilsithe / Cruthaithe: (2019-08-01)

Removing Unnecessary Variables from Horn Clause Verification Conditions
de réir: Emanuele De Angelis, et al.
Foilsithe / Cruthaithe: (2016-07-01)

Disjunctive Datalog
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1997)

Foundations of Declarative Data Analysis Using Limit Datalog Programs
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2017)

Limit Datalog: A declarative query language for data analysis
de réir: Grau, BC, et al.
Foilsithe / Cruthaithe: (2020)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)

Computing datalog rewritings for disjunctive datalog programs and description logic ontologies
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)

Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
de réir: Kaminski, M, et al.
Foilsithe / Cruthaithe: (2014)

Towards Coinductive Theory Exploration in Horn Clause Logic: Position Paper
de réir: Ekaterina Komendantskaya Dr, et al.
Foilsithe / Cruthaithe: (2018-09-01)

Datalog+⁄−: Questions and Answers
de réir: Gottlob, G, et al.
Foilsithe / Cruthaithe: (2014)

Monadic Datalog Containment
de réir: Benedikt, M, et al.
Foilsithe / Cruthaithe: (2012)

On Datalog vs. LFP
de réir: Dawar, A, et al.
Foilsithe / Cruthaithe: (2008)

Adding Disjunction to Datalog
de réir: Eiter, T, et al.
Foilsithe / Cruthaithe: (1994)

Monadic Datalog Containment
de réir: Benedikt, M, et al.
Foilsithe / Cruthaithe: (2012)

Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
de réir: Emanuele De Angelis, et al.
Foilsithe / Cruthaithe: (2019-07-01)

RDFLog: It's like Datalog for RDF
de réir: Bry, F, et al.
Foilsithe / Cruthaithe: (2008)

Maintenance of datalog materialisations revisited
de réir: Motik, B, et al.
Foilsithe / Cruthaithe: (2019)

Inconsistency Handling in Datalog+⁄− Ontologies
de réir: Lukasiewicz, T, et al.
Foilsithe / Cruthaithe: (2012)

Declarative probabilistic programming with datalog
de réir: Barany, V, et al.
Foilsithe / Cruthaithe: (2016)