The following pages link to The DL-Lite Family and Relations (Q3651482):
Displaying 50 items.
- Games for query inseparability of description logic knowledge bases (Q253977) (← links)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Knowledge base exchange: the case of OWL 2 QL (Q309909) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite (Q389229) (← links)
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- View-based query answering in description logics: semantics and complexity (Q414845) (← links)
- Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
- Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases (Q513332) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Tractability and intractability of controlled languages for data access (Q692195) (← links)
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data (Q1678449) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite (Q1680691) (← links)
- Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Query answering DL-lite knowledge bases from hidden datasets (Q2035633) (← links)
- Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) (Q2082509) (← links)
- Actions over core-closed knowledge bases (Q2104517) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure (Q2224833) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
- Foundations of ontology-based data access under bag semantics (Q2321309) (← links)
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) (Q2407461) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Uncertain lightweight ontologies in a product-based possibility theory framework (Q2411268) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies (Q2680773) (← links)
- Exact Query Reformulation with First-Order Ontologies and Databases (Q2915072) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases (Q2970304) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models (Q3172878) (← links)
- Circuit Complexity Meets Ontology-Based Data Access (Q3194705) (← links)
- Assertional Removed Sets Merging of DL-Lite Knowledge Bases (Q3297810) (← links)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications (Q3455775) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- DL-Lite with Temporalised Concepts, Rigid Axioms and Roles (Q3655196) (← links)
- (Q4558528) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- OWL 2 Profiles: An Introduction to Lightweight Ontology Languages (Q4647815) (← links)
- Adding Metalogic Features to Knowledge Representation Languages* (Q5158659) (← links)
- Decidability of Circumscribed Description Logics Revisited (Q5172610) (← links)
- Optimized Query Rewriting for OWL 2 QL (Q5200025) (← links)
- (Q5232905) (← links)
- Scalable Reasoning by Abstraction Beyond DL-Lite (Q5268436) (← links)
- DL-Lite Ontology Revision Based on An Alternative Semantic Characterization (Q5277896) (← links)
