Scalable reasoning by abstraction beyond DL-Lite

DOI10.1007/978-3-319-45276-0_7MaRDI QIDQ5268436zbMATHOpenAlexFDO

Authors Birte Glimm, Yevgeny Kazakov, Trung-Kien Tran

Publication date 20 June 2017

Published in Web Reasoning and Rule Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45276-0_7

Mathematics Subject Classification ID

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

Recommendations

• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Exploring parallel tractability of ontology materialization
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• An abstraction-refinement framework for reasoning with large theories
• On the scalability of description logic instance retrieval

Cites work

• Exponential lower bounds and separation for query rewriting
• PAGOdA: Pay-As-You-Go Ontology Query Answering Using a Datalog Reasoner
• The DL-Lite Family and Relations
• Tractable query answering and rewriting under description logic constraints
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family

Cited in

(3)

• Scalable algorithms for abduction via enumerative syntax-guided synthesis
• Exploring parallel tractability of ontology materialization
• Enhancing context knowledge repositories with justifiable exceptions

Describes a project that uses

Uses Software

• WebPIE
• PAGOdA

This page was built for publication: Scalable reasoning by abstraction beyond DL-Lite

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