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...
主要な著者: | 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, 等
出版事項: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
著者:: Grau, B, 等
出版事項: (2012) -
Goal-driven query answering for existential rules with equality
著者:: Benedikt, M, 等
出版事項: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
著者:: Krötzsch, M, 等
出版事項: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
著者:: Magka, D, 等
出版事項: (2013)