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)