Acyclicity notions for existential rules and their application to query answering in ontologies
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a prominent problem in knowledge representation and databases. This problem can be solved using the chase algorithm, which extends the given set of facts with fresh facts in order to satisfy the rules. If the...
المؤلفون الرئيسيون: | Grau, B, Horrocks, I, Krötzsch, M, Kupke, C, Magka, D, Motik, B, Wang, Z |
---|---|
التنسيق: | Journal article |
اللغة: | English |
منشور في: |
Association for the Advancement of Artificial Intelligence
2013
|
مواد مشابهة
-
Acyclicity Conditions and their Application to Query Answering in Description Logics
حسب: Grau, B, وآخرون
منشور في: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
حسب: Grau, B, وآخرون
منشور في: (2012) -
Goal-driven query answering for existential rules with equality
حسب: Benedikt, M, وآخرون
منشور في: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
حسب: Krötzsch, M, وآخرون
منشور في: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
حسب: Magka, D, وآخرون
منشور في: (2013)