Polynomial combined first-order rewritings for linear and guarded existential rules
We consider the problem of ontological query answering, that is, the problem of answering a database query (typically a conjunctive query) in the presence of an ontology. This means that during the query answering process we also need to take into account the knowledge that can be inferred from the...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
Elsevier
2023
|
Liknande verk
On the complexity of inductively learning guarded clauses
av: Draghici, A, et al.
Publicerad: (2022)
av: Draghici, A, et al.
Publicerad: (2022)