Pages that link to "Item:Q2462646"
From MaRDI portal
The following pages link to Tractable reasoning and efficient query answering in description logics: The DL-Lite family (Q2462646):
Displaying 50 items.
- Certain answers as objects and knowledge (Q2634471) (← links)
- Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics (Q2814376) (← links)
- Query answering with DBoxes is hard (Q2825409) (← links)
- Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis (Q2835863) (← links)
- Reasoning about explanations for negative query answers in \textit{DL-Lite} (Q2865013) (← links)
- On the Interaction of Existential Rules and Equality Constraints in Ontology Querying (Q2900513) (← links)
- Two phase description logic reasoning for efficient information retrieval (Q2909176) (← 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)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics (Q2999101) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models (Q3172878) (← links)
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
- Circuit Complexity Meets Ontology-Based Data Access (Q3194705) (← links)
- Assertional Removed Sets Merging of DL-Lite Knowledge Bases (Q3297810) (← links)
- Quantitative Logic Reasoning (Q3305344) (← links)
- Rewriting guarded existential rules into small Datalog programs (Q3305347) (← links)
- Doctoral Consortium Extended Abstract: Default Mappings in Ontology-Based Data Access (Q3449240) (← links)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications (Q3455775) (← links)
- ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS (Q3462270) (← links)
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ (Q3532465) (← links)
- The role of semantics in mining frequent patterns from knowledge bases in description logics with rules (Q3577710) (← links)
- Inductive Logic Programming in Databases: From <scp>Datalog</scp> to (Q3577712) (← links)
- Formal Properties of Modularisation (Q3631354) (← links)
- Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations (Q3637268) (← links)
- Foundations of Temporal Conceptual Data Models (Q3637331) (← links)
- Conceptual Modeling for Data Integration (Q3637334) (← links)
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web (Q3638227) (← links)
- Description Logics (Q3638996) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- DL-Lite with Temporalised Concepts, Rigid Axioms and Roles (Q3655196) (← links)
- (Q4558528) (← links)
- Semantic Reasoning with Uncertain Information from Unreliable Sources (Q4571141) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- Datalog and Its Extensions for Semantic Web Databases (Q4647813) (← links)
- OWL 2 Profiles: An Introduction to Lightweight Ontology Languages (Q4647815) (← links)
- Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (Q4911144) (← links)
- Inlining External Sources in Answer Set Programs (Q4957183) (← links)
- Characterizing Boundedness in Chase Variants (Q4957209) (← links)
- Instance-Level Update in DL-Lite Ontologies through First-Order Rewriting (Q4989324) (← links)
- An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies (Q5054970) (← links)
- A Single Approach to Decide Chase Termination on Linear Existential Rules (Q5091131) (← links)
- Decidability of Circumscribed Description Logics Revisited (Q5172610) (← links)
- Optimized Query Rewriting for OWL 2 QL (Q5200025) (← links)
- (Q5232905) (← links)
- Query Rewriting under Linear $$\mathcal {EL}$$ Knowledge Bases (Q5268434) (← links)
- Scalable Reasoning by Abstraction Beyond DL-Lite (Q5268436) (← links)
