Name
Abstract | ||
|---|---|---|
An important approach to query answering over OWL ontologies is via rewriting the input ontology (and query) into a new set of axioms that are expressed in logics for which scalable query answering algorithms exist. This approach has been studied for many important fragments of OWL like SHIQ, Horn-SHIQ, OWL 2 QL, and OWL 2 EL. An important family of rewriting algorithms is the family of resolution-based algorithms, mostly because of their ability to adapt to any ontology language (such algorithms have been proposed for all aforementioned logics) and the long years of research in resolution theorem-proving. However, this generality comes with performance prices and many approaches that implement algorithms that are tailor-made to a specific language are more efficient than the (usually) general-purposed resolution-based ones. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.websem.2015.02.001 | Journal of Web Semantics |
Keywords | Field | DocType |
Query answering,Query rewriting,Ontology,Description logics,Resolution | Ontology (information science),Ontology,Axiom,Computer science,Algorithm,Description logic,Theoretical computer science,Rewriting,Web Ontology Language,Scalability,Ontology language | Journal |
Volume | ISSN | Citations |
33 | 1570-8268 | 21 |
PageRank | References | Authors |
0.79 | 38 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Despoina Trivela | 1 | 87 | 5.62 |
| Giorgos Stoilos | 2 | 1241 | 67.47 |
| Alexandros Chortaras | 3 | 116 | 12.31 |
| Giorgos Stamou | 4 | 1200 | 76.88 |