The DL-Lite Family and Relations
From MaRDI portal
Publication:3651482
DOI10.1613/jair.2820zbMath1192.68657arXiv1401.3487WikidataQ62048637 ScholiaQ62048637MaRDI QIDQ3651482
Diego Calvanese, Alessandro Artale, Roman Kontchakov, Michael Zakharyashchev
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3487
68T27: Logic in artificial intelligence
Related Items
Unnamed Item, Reasoning and Query Answering in Description Logics, OWL 2 Profiles: An Introduction to Lightweight Ontology Languages, Unnamed Item, Adding Metalogic Features to Knowledge Representation Languages*, Decidability of Circumscribed Description Logics Revisited, Optimized Query Rewriting for OWL 2 QL, Unnamed Item, Scalable Reasoning by Abstraction Beyond DL-Lite, DL-Lite Ontology Revision Based on An Alternative Semantic Characterization, Games for query inseparability of description logic knowledge bases, Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies, Knowledge base exchange: the case of OWL 2 QL, Towards more expressive ontology languages: the query answering problem, Capturing model-based ontology evolution at the instance level: the case of DL-Lite, Generalized satisfiability for the description logic \(\mathcal{ALC}\), View-based query answering in description logics: semantics and complexity, Consequence-based and fixed-parameter tractable reasoning in description logics, Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases, Logic-based ontology comparison and module extraction, with an application to DL-Lite, Tractability and intractability of controlled languages for data access, Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data, Understanding the complexity of axiom pinpointing in lightweight description logics, A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite, Logical foundations of information disclosure in ontology-based data integration, The complexity of Bayesian networks specified by propositional and relational languages, Query answering DL-lite knowledge bases from hidden datasets, Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\), A tetrachotomy of ontology-mediated queries with a covering axiom, A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure, First-order rewritability of ontology-mediated queries in linear temporal logic, The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws, Foundations of ontology-based data access under bag semantics, On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\), Bounds in ontology-based data access via circuit complexity, Uncertain lightweight ontologies in a product-based possibility theory framework, The price of query rewriting in ontology-based data access, Exact Query Reformulation with First-Order Ontologies and Databases, A Cookbook for Temporal Conceptual Data Modelling with Description Logics, Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey, Inconsistency-Tolerant Querying of Description Logic Knowledge Bases, Ontology-Mediated Query Answering with Data-Tractable Description Logics, Generalized Satisfiability for the Description Logic $\mathcal{ALC}$, Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models, Circuit Complexity Meets Ontology-Based Data Access, Assertional Removed Sets Merging of DL-Lite Knowledge Bases, Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications, Ontologies and Databases: The DL-Lite Approach, DL-Lite with Temporalised Concepts, Rigid Axioms and Roles
