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...
Những tác giả chính: | Grau, B, Horrocks, I, Krötzsch, M, Kupke, C, Magka, D, Motik, B, Wang, Z |
---|---|
Định dạng: | Journal article |
Ngôn ngữ: | English |
Được phát hành: |
Association for the Advancement of Artificial Intelligence
2013
|
Những quyển sách tương tự
-
Acyclicity Conditions and their Application to Query Answering in Description Logics
Bằng: Grau, B, et al.
Được phát hành: (2012) -
Acyclicity Conditions and their Application to Query Answering in Description Logics
Bằng: Grau, B, et al.
Được phát hành: (2012) -
Goal-driven query answering for existential rules with equality
Bằng: Benedikt, M, et al.
Được phát hành: (2018) -
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness.
Bằng: Krötzsch, M, et al.
Được phát hành: (2011) -
Computing Stable Models for Nonmonotonic Existential Rules
Bằng: Magka, D, et al.
Được phát hành: (2013)