Inproceedings4059: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Long Cheng (Diskussion | Beiträge) K (1 Version: Automatically imported publication data from DBLP) |
Michael Thomazo (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname=Michaël | |||
|ErsterAutorNachname=Thomazo | |ErsterAutorNachname=Thomazo | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Compact Rewritings for Existential Rules | |Title=Compact Rewritings for Existential Rules | ||
|To appear=0 | |||
|Year=2013 | |Year=2013 | ||
|Booktitle=IJCAI | |Booktitle=IJCAI | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract= | |Abstract=Querying large databases while taking ontologies into account is currently a very active domain research. In this paper, we consider ontologies described by existential rules (also known as Datalog+/-), a framework that generalizes lightweight description logics. A common approach is to rewrite a conjunctive query w.r.t an ontology into a union of conjunctive queries (UCQ) which can be directly evaluated against a database. However, the practicability of this approach is questionable due to 1) the weak expressivity of classes for which efficient rewriters have been implemented 2) the large size of optimal rewritings using UCQ. We propose to use semi-conjunctive queries (SCQ), which are a restricted form of positive existential formulas, and compute sound and complete rewritings, which are union of SCQ (USCQ). A novel algorithm for query rewriting, Compact, is presented. It computes sound and complete rewritings for large classes of ontologies. First experiments show that USCQ are both efficiently computable and more efficiently evaluable than their equivalent UCQ. | ||
| | |Link=http://ijcai.org/papers13/Papers/IJCAI13-170.pdf | ||
| | |Forschungsgruppe=Computational Logic | ||
|DOI=http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6826 | |DOI=http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6826 | ||
}} | |||
| | {{Forschungsgebiet Auswahl | ||
|Forschungsgebiet=Existenzielle Regeln | |||
}} | }} | ||
Version vom 28. Oktober 2014, 17:34 Uhr
Compact Rewritings for Existential Rules
Michaël ThomazoMichaël Thomazo
Michaël Thomazo
Compact Rewritings for Existential Rules
IJCAI, 2013
Compact Rewritings for Existential Rules
IJCAI, 2013
- KurzfassungAbstract
Querying large databases while taking ontologies into account is currently a very active domain research. In this paper, we consider ontologies described by existential rules (also known as Datalog+/-), a framework that generalizes lightweight description logics. A common approach is to rewrite a conjunctive query w.r.t an ontology into a union of conjunctive queries (UCQ) which can be directly evaluated against a database. However, the practicability of this approach is questionable due to 1) the weak expressivity of classes for which efficient rewriters have been implemented 2) the large size of optimal rewritings using UCQ. We propose to use semi-conjunctive queries (SCQ), which are a restricted form of positive existential formulas, and compute sound and complete rewritings, which are union of SCQ (USCQ). A novel algorithm for query rewriting, Compact, is presented. It computes sound and complete rewritings for large classes of ontologies. First experiments show that USCQ are both efficiently computable and more efficiently evaluable than their equivalent UCQ. - Weitere Informationen unter:Further Information: Link
- Forschungsgruppe:Research Group: Computational LogicComputational Logic
@inproceedings{T2013,
author = {Micha{\"{e}}l Thomazo},
title = {Compact Rewritings for Existential Rules},
booktitle = {IJCAI},
year = {2013}
}
