Reasoning and Query Answering in Description Logics

DOI10.1007/978-3-642-33158-9_1zbMATH Open1251.68228OpenAlexW166892013MaRDI QIDQ4647812FDOQ4647812

Mantas Šimkus, Magdalena Ortiz

Publication date: 8 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33158-9_1

zbMATH Keywords

query answeringdescription logicsontology-based data access

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Cites Work

• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
• The DL-Lite Family and Relations
• Title not available (Why is that?)
• Linking Data to Ontologies
• The Description Logic Handbook
• Title not available (Why is that?)
• Practical reasoning for very expressive description logics
• Tractable query answering and rewriting under description logic constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata-theoretic techniques for modal logics of programs
• Terminological reasoning is inherently intractable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conjunctive query containment and answering under description logic constraints
• Rewriting of regular expressions and regular path queries
• Information integration using logical views
• Decidable containment of recursive queries
• Combining Horn rules and description logics in CARIN
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• Title not available (Why is that?)
• Query Answering in Description Logics: The Knots Approach
• Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
• Expressibility and Parallel Complexity
• Title not available (Why is that?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Data complexity of query answering in expressive description logics via tableaux
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Title not available (Why is that?)
• The Complexity of Enriched Mu-Calculi
• Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!
• Data-complexity of the two-variable fragment with counting quantifiers
• OWL 2 Profiles: An Introduction to Lightweight Ontology Languages
• Optimized Query Rewriting for OWL 2 QL
• Datalog and Its Extensions for Semantic Web Databases
• Role Conjunctions in Expressive Description Logics

Cited In (17)

• Title not available (Why is that?)
• Logic Programming
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
• Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics
• Title not available (Why is that?)
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• CTL\(^\ast\) with graded path modalities
• A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,×
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Reasoning with ontologies
• Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete
• Title not available (Why is that?)
• OWL 2 Profiles: An Introduction to Lightweight Ontology Languages
• Classical algorithms for reasoning and explanation in description logics
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
• Practical reasoning for very expressive description logics

This page was built for publication: Reasoning and Query Answering in Description Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647812)