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...
Hlavní autoři: | Cathcart Burn, T, Ong, C-H, Ramsay, S, Wagner, D |
---|---|
Médium: | Conference item |
Jazyk: | English |
Vydáno: |
IEEE
2021
|
Podobné jednotky
-
Higher-order constrained horn clauses for verification
Autor: Cathcart Burn, T, a další
Vydáno: (2017) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
Autor: Cuenca Grau, B, a další
Vydáno: (2016) -
Computing Datalog Rewritings Beyond Horn Ontologies
Autor: Grau, B, a další
Vydáno: (2013) -
Datalog rewriting techniques for non-Horn ontologies
Autor: Kaminski, M, a další
Vydáno: (2014) -
Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions
Autor: Qi Zhou, a další
Vydáno: (2018-09-01)