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