Overview
- Provides an innovative approach for reasoning with description logic theories
- Presents future practical applications of description logic proof theories
- Includes supplementary material: sn.pub/extras
Part of the book series: SpringerBriefs in Computer Science (BRIEFSCOMPUTER)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (9 chapters)
-
Front Matter
Keywords
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.
Authors and Affiliations
Bibliographic Information
Book Title: A Proof Theory for Description Logics
Authors: Alexandre Rademaker
Series Title: SpringerBriefs in Computer Science
DOI: https://doi.org/10.1007/978-1-4471-4002-3
Publisher: Springer London
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Author(s) 2012
Softcover ISBN: 978-1-4471-4001-6Published: 18 May 2012
eBook ISBN: 978-1-4471-4002-3Published: 17 May 2012
Series ISSN: 2191-5768
Series E-ISSN: 2191-5776
Edition Number: 1
Number of Pages: X, 106
Number of Illustrations: 16 b/w illustrations
Topics: Mathematical Logic and Formal Languages, Mathematics of Computing