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 |
---|---|
פורמט: | Journal article |
שפה: | English |
יצא לאור: |
Association for the Advancement of Artificial Intelligence
2013
|
פריטים דומים
-
Acyclicity Conditions and their Application to Query Answering in Description Logics
מאת: Grau, B, et al.
יצא לאור: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
מאת: Grau, B, et al.
יצא לאור: (2012) -
Goal-driven query answering for existential rules with equality
מאת: Benedikt, M, et al.
יצא לאור: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
מאת: Krötzsch, M, et al.
יצא לאור: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
מאת: Magka, D, et al.
יצא לאור: (2013)