Table of contents
About this book
Description Logics (DLs) is a family of formalisms used to represent knowledge of a domain. They are equipped with a formal logic-based semantics. Knowledge representation systems based on description logics provide various inference capabilities that deduce implicit knowledge from the explicitly represented knowledge.
A Proof Theory for Description Logics introduces Sequent Calculi and Natural Deduction for some DLs (ALC, ALCQ). Cut-elimination and Normalization are proved for the calculi. The author argues that such systems can improve the extraction of computational content from DLs proofs for explanation purposes.
- DOI https://doi.org/10.1007/978-1-4471-4002-3
- Copyright Information The Author(s) 2012
- Publisher Name Springer, London
- eBook Packages Computer Science Computer Science (R0)
- Print ISBN 978-1-4471-4001-6
- Online ISBN 978-1-4471-4002-3
- Series Print ISSN 2191-5768
- Series Online ISSN 2191-5776
- Buy this book on publisher's site