Name
Abstract | ||
|---|---|---|
We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on the oblivious and the semi-oblivious chase variants, we give a characterization of boundedness in terms of FO-rewritability and chase termination. We show that it is decidable to recognize if a set of rules is bounded for several classes and outline the complexity of the problem. This report contains the paper published at IJCAI 2019 and an appendix with full proofs. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.24963/ijcai.2019/219 | IJCAI |
Field | DocType | Citations |
Discrete mathematics,Existentialism,Computer science,Theoretical computer science | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Bourhis | 1 | 675 | 46.80 |
| Michel Leclère | 2 | 359 | 27.21 |
| Marie-laure Mugnier | 3 | 859 | 80.16 |
| Sophie Tison | 4 | 625 | 53.49 |
| Federico Ulliana | 5 | 31 | 6.57 |
| Lily Gallois | 6 | 0 | 0.34 |