Abstract
Fixed-domain reasoning over OWL ontologies is adequate in certain closed-world scenarios and has been shown to be both useful and feasible in practice. However, the reasoning modes hitherto supported by available tools do not include querying. We provide the formal foundations of querying under the fixed domain semantics, based on the principle of certain answers, and show how fixed-domain querying can be incorporated in existing reasoning methods using answer set programming (ASP).
Cite
CITATION STYLE
Rudolph, S., Schweizer, L., & Yao, Z. (2019). SPARQL queries over ontologies under the fixed-domain semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11670 LNAI, pp. 486–499). Springer Verlag. https://doi.org/10.1007/978-3-030-29908-8_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
