Extended caching, backjumping and merging for expressive description logics

DOI10.1007/978-3-642-31365-3_40zbMATH Open1358.68284OpenAlexW39809549MaRDI QIDQ2908522FDOQ2908522

Authors: Andreas Steigmiller, Thorsten Liebig, Birte Glimm 

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-80259

Recommendations

• Optimizing terminological reasoning for expressive description logics
• Optimized description logic reasoning via core blocking
• Optimizing description logic subsumption
• Pay-as-you-go description logic reasoning by coupling tableau and saturation procedures
• scientific article; zbMATH DE number 1765662

Mathematics Subject Classification ID

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

Cited In (6)

• Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics
• Optimized description logic reasoning via core blocking
• Reasoning with nominal schemas through absorption
• The limits of decidability in fuzzy description logics with general concept inclusions
• OWL reasoning: subsumption test hardness and modularity
• Optimizing terminological reasoning for expressive description logics

Uses Software

• FaCT++
• Konclude

This page was built for publication: Extended caching, backjumping and merging for expressive description logics

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