A Proof Theory for Description Logics
Alexandre Rademaker
Sold by Buchpark, Trebbin, Germany
AbeBooks Seller since 30 September 2021
Used - Soft cover
Condition: Sehr gut
Quantity: 1 available
Add to basketSold by Buchpark, Trebbin, Germany
AbeBooks Seller since 30 September 2021
Condition: Sehr gut
Quantity: 1 available
Add to basketZustand: Sehr gut | Seiten: 106 | Sprache: Englisch | Produktart: Sonstiges.
Seller Inventory # 12007945/12
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.