Tractable reasoning and efficient query answering in description logics: The DL-Lite family
From MaRDI portal
Publication:2462646
Recommendations
Cites work
- An epistemic operator for description logics
- Answer sets for consistent query answering in inconsistent databases
- Combining Horn rules and description logics in CARIN
- Data complexity of query answering in description logics
- Data complexity of query answering in expressive description logics via tableaux
- Data Integration through ${\textit{DL-Lite}_{\mathcal A}}$ Ontologies
- Deduction in Concept Languages: from Subsumption to Instance Checking
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Integrity constraints for XML
- Linking Data to Ontologies
- On Instance-level Update and Erasure in Description Logic Ontologies
- Recursive query plans for data integration
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Cited in
(only showing first 100 items - show all)- On the scalability of description logic instance retrieval
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
- Logic-based argumentation with existential rules
- 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
- Enhancing context knowledge repositories with justifiable exceptions
- Tractable reasoning in description logics with functionality constraints
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning
- Query answering DL-lite knowledge bases from hidden datasets
- Enhancing probabilistic model checking with ontologies
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Metamodeling and metaquerying in \texttt{OWL 2 QL}
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Answering regular path queries in expressive description logics via alternating tree-automata
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Foundations of ontology-based data access under bag semantics
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- A universal approach to guarantee data privacy
- Bounds in ontology-based data access via circuit complexity
- Uncertain lightweight ontologies in a product-based possibility theory framework
- Modal definability of first-order formulas with free variables and query answering
- FLP answer set semantics without circular justifications for general logic programs
- The price of query rewriting in ontology-based data access
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Games for query inseparability of description logic knowledge bases
- Certain answers as objects and knowledge
- Tractable approximate deduction for OWL
- scientific article; zbMATH DE number 1696851 (Why is no real title available?)
- Investigating the mapping between default logic and inconsistency-tolerant semantics
- Query answering with DBoxes is hard
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Reasoning about explanations for negative query answers in \textit{DL-Lite}
- On the interaction of existential rules and equality constraints in ontology querying
- Two phase description logic reasoning for efficient information retrieval
- Query answering over description logic ontologies
- 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
- Recent advances in Datalog^
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
- Knowledge base exchange: the case of OWL 2 QL
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
- Circuit complexity meets ontology-based data access
- Data repair of inconsistent nonmonotonic description logic programs
- Assertional removed sets merging of DL-Lite knowledge bases
- Quantitative logic reasoning
- Rewriting guarded existential rules into small Datalog programs
- Doctoral consortium extended abstract: Default mappings in ontology-based data access
- Introducing datatypes in DL-Lite
- Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
- DL-Lite with attributes and datatypes
- Eliminating concepts and roles from ontologies in expressive descriptive logics
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite
- The role of semantics in mining frequent patterns from knowledge bases in description logics with rules
- Inductive logic programming in databases: from Datalog to \(\mathcal {DL} + \text{LOG}^{\neg \vee}\)
- Towards more expressive ontology languages: the query answering problem
- Data complexity of query answering in description logics
- Island reasoning for \(\mathcal{ALCHI}\) ontologies
- Formal Properties of Modularisation
- Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations
- Foundations of Temporal Conceptual Data Models
- Conceptual Modeling for Data Integration
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
- Description Logics
- Ontologies and Databases: The DL-Lite Approach
- DL-Lite with temporalised concepts, rigid axioms and roles
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite
- Semantic query optimization in the presence of types
- View-based query answering in description logics: semantics and complexity
- Foundations of instance level updates in expressive description logics
- Tightly integrated probabilistic description logic programs for representing ontology mappings
- Exact learning of lightweight description logic ontologies
- Semantic reasoning with uncertain information from unreliable sources
- Reasoning and query answering in description logics
- Datalog and Its Extensions for Semantic Web Databases
- OWL 2 profiles: an introduction to lightweight ontology languages
- Consequence-based and fixed-parameter tractable reasoning in description logics
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- Inlining external sources in answer set programs
- Characterizing boundedness in chase variants
- Instance-level update in DL-Lite ontologies through first-order rewriting
- An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- Prioritized assertional-based removed sets revision of \textit{DL}-\textit{Lite} belief bases
- Decidability of circumscribed description logics revisited
- On the complexity of propositional and relational credal networks
- Optimized query rewriting for OWL 2 QL
- On intuitionistic query answering in description bases
- The data complexity of ontology-mediated queries with closed predicates
- Query rewriting under linear \(\mathcal {EL}\) knowledge bases
This page was built for publication: Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2462646)
