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