Saturday, May 31, 2014

A Proof Theory for Description Logics

A Proof Theory for Description Logics By Alexandre Rademaker


Review:

Description Logics (DLs) is a household of formalisms used to characterize information of a site. They are geared up with a proper logic-based mostly semantics. Knowledge illustration techniques primarily based on description logics present numerous inference capabilities that deduce implicit information from the explicitly represented data.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 writer argues that such methods can enhance the extraction of computational content material from DLs proofs for rationalization functions.


No comments:

Post a Comment