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...
Autores principales: | Grau, B, Horrocks, I, Krötzsch, M, Kupke, C, Magka, D, Motik, B, Wang, Z |
---|---|
Formato: | Journal article |
Lenguaje: | English |
Publicado: |
Association for the Advancement of Artificial Intelligence
2013
|
Ejemplares similares
-
Acyclicity Conditions and their Application to Query Answering in Description Logics
por: Grau, B, et al.
Publicado: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
por: Grau, B, et al.
Publicado: (2012) -
Goal-driven query answering for existential rules with equality
por: Benedikt, M, et al.
Publicado: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
por: Krötzsch, M, et al.
Publicado: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
por: Magka, D, et al.
Publicado: (2013)