Extended Caching, Backjumping and Merging for Expressive Description Logics

DOI10.1007/978-3-642-31365-3_40zbMath1358.68284OpenAlexW39809549MaRDI QIDQ2908522

Birte Glimm, Andreas Steigmiller, Thorsten Liebig

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

Mathematics Subject Classification ID

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

Related Items (4)

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

Uses Software

• FaCT++
• Konclude

This page was built for publication: Extended Caching, Backjumping and Merging for Expressive Description Logics