Scalable Reasoning by Abstraction Beyond DL-Lite

DOI10.1007/978-3-319-45276-0_7zbMATH Open1366.68287OpenAlexW2513733182MaRDI QIDQ5268436FDOQ5268436

Yevgeny Kazakov, Trung-Kien Tran, Birte Glimm

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)

Cites Work

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

Cited In (2)

• Enhancing context knowledge repositories with justifiable exceptions
• Scalable algorithms for abduction via enumerative syntax-guided synthesis

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)