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...
Asıl Yazarlar: | Grau, B, Horrocks, I, Krötzsch, M, Kupke, C, Magka, D, Motik, B, Wang, Z |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
Association for the Advancement of Artificial Intelligence
2013
|
Benzer Materyaller
-
Acyclicity Conditions and their Application to Query Answering in Description Logics
Yazar:: Grau, B, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
Yazar:: Grau, B, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
Goal-driven query answering for existential rules with equality
Yazar:: Benedikt, M, ve diğerleri
Baskı/Yayın Bilgisi: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
Yazar:: Krötzsch, M, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
Yazar:: Magka, D, ve diğerleri
Baskı/Yayın Bilgisi: (2013)