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)