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...
Prif Awduron: | Grau, B, Horrocks, I, Krötzsch, M, Kupke, C, Magka, D, Motik, B, Wang, Z |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Association for the Advancement of Artificial Intelligence
2013
|
Eitemau Tebyg
Import−by−Query: Ontology Reasoning under Access Limitations
gan: Grau, B, et al.
Cyhoeddwyd: (2009)
gan: Grau, B, et al.
Cyhoeddwyd: (2009)
Import−by−Query: Ontology Reasoning under Access Limitations
gan: Grau, B, et al.
Cyhoeddwyd: (2015)
gan: Grau, B, et al.
Cyhoeddwyd: (2015)
Eitemau Tebyg
-
Acyclicity Conditions and their Application to Query Answering in Description Logics
gan: Grau, B, et al.
Cyhoeddwyd: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
gan: Grau, B, et al.
Cyhoeddwyd: (2012) -
Goal-driven query answering for existential rules with equality
gan: Benedikt, M, et al.
Cyhoeddwyd: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
gan: Krötzsch, M, et al.
Cyhoeddwyd: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
gan: Magka, D, et al.
Cyhoeddwyd: (2013)