A Proof Theory for Description Logics
Rademaker Alexandre
Sold by Biblios, Frankfurt am main, HESSE, Germany
AbeBooks Seller since 10 September 2024
New - Soft cover
Condition: New
Quantity: 4 available
Add to basketSold by Biblios, Frankfurt am main, HESSE, Germany
AbeBooks Seller since 10 September 2024
Condition: New
Quantity: 4 available
Add to basketPRINT ON DEMAND pp. 118.
Seller Inventory # 1858582750
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.
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.
"About this title" may belong to another edition of this title.