Reasoning with ontologies

DOI10.1007/978-3-030-06164-7_6MaRDI QIDQ6602220zbMATH OpenFDO

Authors Meghyn Bienvenu, Michel Leclère, Marie-Laure Mugnier, Marie-Christine Rousset

Publication date 11 September 2024

Mathematics Subject Classification ID

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

Recommendations

• Description logics for ontologies
• Description Logics
• Description logics in knowledge representation
• scientific article; zbMATH DE number 2090284
• Logic Programming

Cites work

• scientific article; zbMATH DE number 67503 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 1405450 (Why is no real title available?)
• scientific article; zbMATH DE number 1405765 (Why is no real title available?)
• Acyclicity notions for existential rules and their application to query answering in ontologies
• An introduction to description logic
• Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
• Data exchange: semantics and query answering
• Datalog and Its Extensions for Semantic Web Databases
• Graph-based knowledge representation. Computational foundations of conceptual graphs
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• Linking Data to Ontologies
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Model-theoretic inseparability and modularity of description logic ontologies
• Modular reuse of ontologies: theory and practice
• On rules with existential variables: walking the decidability line
• On the relative expressiveness of description logics and predicate logics
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
• Reasoning and query answering in description logics
• Regular path queries in lightweight description logics: complexity and algorithms
• Terminological reasoning is inherently intractable
• The DL-Lite Family and Relations
• The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
• The logic system of concept graphs with negation. And its relationship to predicate logic.
• The price of query rewriting in ontology-based data access
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Understanding the complexity of axiom pinpointing in lightweight description logics

This page was built for publication: Reasoning with ontologies

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