2016/07/07 by Daniel P. Lupp, Lupp, Daniel P., Evgenij Thorstensen +1
Computer Science · #Artificial Intelligence (cs.AI) #Databases (cs.DB) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.1607.02018
openalex publication_date 2016/07/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In ontology-based data access, databases are connected to an ontology via mappings from queries over the database to queries over the ontology. In this paper, we consider mappings from relational databases to first-order ontologies, and define an ASP-based framework for GLAV mappings with queries over the ontology in the mapping rule bodies. We show that this type of mappings can be used to express constraints and exceptions, as well as being a powerful mechanism for succinctly representing OBDA mappings. We give an algorithm for brave reasoning in this setting, and show that this problem has either the same data complexity as ASP (NP- complete), or it is at least as hard as the complexity of checking entailment for the ontology queries. Furthermore, we show that for ontologies with UCQ-rewritable queries there exists a natural reduction from mapping programs to ∃-ASP, an extension of ASP with existential variables that itself admits a natural reduction to ASP.