A Proof Theory for Description Logics

By Alexandre Rademaker

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.

• Format: Paperback
• Language: English
• ISBN: 144714001X
• ISBN13: 9781447140016
• Release Date: May 2012
• Publisher: Springer
• Length: 106 Pages
• Weight: 0.50 lbs.
• Dimensions: 0.3" x 6.1" x 9.0"