A Proof Theory for Description Logics PDF
by Alexandre Rademaker
Part of the SpringerBriefs in Computer Science series
- Information
Description
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.
Information
-
Download Now
- Format:PDF
- Publisher:Springer London
- Publication Date:17/05/2012
- Category:
- ISBN:9781447140023
Information
-
Download Now
- Format:PDF
- Publisher:Springer London
- Publication Date:17/05/2012
- Category:
- ISBN:9781447140023
