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
|
Схожие документы
Import−by−Query: Ontology Reasoning under Access Limitations
по: Grau, B, и др.
Опубликовано: (2009)
по: Grau, B, и др.
Опубликовано: (2009)
Import−by−Query: Ontology Reasoning under Access Limitations
по: Grau, B, и др.
Опубликовано: (2015)
по: Grau, B, и др.
Опубликовано: (2015)
Схожие документы
-
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)