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.
- Games for query inseparability of description logic knowledge bases (Q253977) (← links)
- Tractable approximate deduction for OWL (Q274420) (← links)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Knowledge base exchange: the case of OWL 2 QL (Q309909) (← links)
- Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Data complexity of query answering in description logics (Q360130) (← links)
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite (Q389229) (← links)
- Semantic query optimization in the presence of types (Q389237) (← links)
- View-based query answering in description logics: semantics and complexity (Q414845) (← links)
- Foundations of instance level updates in expressive description logics (Q420809) (← links)
- Tightly integrated probabilistic description logic programs for representing ontology mappings (Q429437) (← 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)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- A description logic based situation calculus (Q604908) (← links)
- Forgetting for knowledge bases in DL-lite (Q604910) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- On rules with existential variables: walking the decidability line (Q646515) (← links)
- Top-\(k\) retrieval for ontology mediated access to relational databases (Q712661) (← links)
- Data complexity of query answering in expressive description logics via tableaux (Q945056) (← links)
- Tractable query answering and rewriting under description logic constraints (Q975872) (← links)
- On the scalability of description logic instance retrieval (Q1040773) (← links)
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin (Q1653439) (← links)
- Logic-based argumentation with existential rules (Q1678415) (← 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)
- Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
- Tractable reasoning in description logics with functionality constraints (Q1799301) (← links)
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning (Q1928818) (← links)
- Query answering DL-lite knowledge bases from hidden datasets (Q2035633) (← links)
- Enhancing probabilistic model checking with ontologies (Q2065528) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Metamodeling and metaquerying in \texttt{OWL 2 QL} (Q2238670) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- Foundations of ontology-based data access under bag semantics (Q2321309) (← links)
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies (Q2352492) (← links)
- A universal approach to guarantee data privacy (Q2392012) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Uncertain lightweight ontologies in a product-based possibility theory framework (Q2411268) (← links)
- Modal definability of first-order formulas with free variables and query answering (Q2446543) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family (Q2462646) (← links)
