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...
Hlavní autoři: | Grau, B, Horrocks, I, Krötzsch, M, Kupke, C, Magka, D, Motik, B, Wang, Z |
---|---|
Médium: | Journal article |
Jazyk: | English |
Vydáno: |
Association for the Advancement of Artificial Intelligence
2013
|
Podobné jednotky
-
Acyclicity Conditions and their Application to Query Answering in Description Logics
Autor: Grau, B, a další
Vydáno: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
Autor: Grau, B, a další
Vydáno: (2012) -
Goal-driven query answering for existential rules with equality
Autor: Benedikt, M, a další
Vydáno: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
Autor: Krötzsch, M, a další
Vydáno: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
Autor: Magka, D, a další
Vydáno: (2013)