2000 character limit reached
Do Repeat Yourself: Understanding Sufficient Conditions for Restricted Chase Non-Termination (2309.12710v1)
Published 22 Sep 2023 in cs.LO
Abstract: The disjunctive restricted chase is a sound and complete procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. Alas, this procedure does not always terminate and checking if it does is undecidable. However, we can use acyclicity notions (sufficient conditions that imply termination) to effectively apply the chase in many real-world cases. To know if these conditions are as general as possible, we can use cyclicity notions (sufficient conditions that imply non-termination). In this paper, we discuss some issues with previously existing cyclicity notions, propose some novel notions for non-termination by dismantling the original idea, and empirically verify the generality of the new criteria.
- 2014. Extending acyclicity notions for existential rules. In Schaub, T.; Friedrich, G.; and O’Sullivan, B., eds., Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), Czech Republic, volume 263 of Frontiers in Artificial Intelligence and Applications, 39–44. IOS Press.
- 1981. The implication problem for data dependencies. In Even, S., and Kariv, O., eds., Proceedings of the 8th International Colloquium on Automata, Languages and Programming (ICALP 1981), Israel, volume 115 of Lecture Notes in Computer Science, 73–85. Springer.
- 2016. Guarded-based disjunctive tuple-generating dependencies. ACM Transactions On Database Systems (TODS) 41(4):27:1–27:45.
- 2017. Restricted chase (non)termination for existential rules with disjunctions. In Sierra, C., ed., Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Australia, 922–928. ijcai.org.
- 2013. Acyclicity notions for existential rules and their application to query answering in ontologies. Journal of Artificial Intelligence Resesearch (JAIR) 47:741–808.
- 2005. Data exchange: semantics and query answering. Theoretical Computer Science 336(1):89–124.
- 2023a. Do repeat yourself: Understanding sufficient conditions for restricted chase non-termination: Evaluation materials. https://doi.org/10.5281/zenodo.8005904.
- 2023b. General acyclicity and cyclicity notions for the disjunctive skolem chase. In Williams, B.; Chen, Y.; and Neville, J., eds., Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023, USA, 6372–6379. AAAI Press.
- 2014. All-instances termination of chase is undecidable. In Esparza, J.; Fraigniaud, P.; Husfeldt, T.; and Koutsoupias, E., eds., Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), Denmark, Part II, volume 8573 of Lecture Notes in Computer Science, 293–304. Springer.
- 2018. Anatomy of the chase. Fundamenta Informaticae 157(3):221–270.
- 2021. Restricted chase termination for existential rules: A hierarchical approach and experimentation. Theory and Practice of Logic Programming 21(1):4–50.
- 2011. Extending decidable existential rules by joining acyclicity and guardedness. In Walsh, T., ed., Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), Spain, 963–968. IJCAI/AAAI.
- Marnette, B. 2009. Generalized schema-mappings: from termination to tractability. In Paredaens, J., and Su, J., eds., Proceedings of the 28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2009), USA, 13–22. ACM.
- 2014. The manchester OWL repository: System description. In Horridge, M.; Rospocher, M.; and van Ossenbruggen, J., eds., Proceedings of the 13th International Semantic Web Conference (ISWC 2014), Posters & Demonstrations Track, Italy, volume 1272 of CEUR Workshop Proceedings, 285–288. CEUR-WS.org.