Acyclicity Conditions and their Application to Query Answering in Description Logics
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a key problem in knowledge representation and databases. This problem can be solved using the chase (aka materialisation) algorithm; however, CQ answering is undecidable for general existential rules, so the c...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Conference item |
| Published: |
AAAI Press
2012
|