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...
Asıl Yazarlar: | Cathcart Burn, T, Ong, C-H, Ramsay, S, Wagner, D |
---|---|
Materyal Türü: | Conference item |
Dil: | English |
Baskı/Yayın Bilgisi: |
IEEE
2021
|
Benzer Materyaller
-
Higher-order constrained horn clauses for verification
Yazar:: Cathcart Burn, T, ve diğerleri
Baskı/Yayın Bilgisi: (2017) -
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
Yazar:: Cuenca Grau, B, ve diğerleri
Baskı/Yayın Bilgisi: (2016) -
Computing Datalog Rewritings Beyond Horn Ontologies
Yazar:: Grau, B, ve diğerleri
Baskı/Yayın Bilgisi: (2013) -
Datalog rewriting techniques for non-Horn ontologies
Yazar:: Kaminski, M, ve diğerleri
Baskı/Yayın Bilgisi: (2014) -
Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions
Yazar:: Qi Zhou, ve diğerleri
Baskı/Yayın Bilgisi: (2018-09-01)