Andere Kunden interessierten sich auch für
![Proofs and Algorithms]( "Proofs and Algorithms")
Proofs and Algorithms26,99 €![Handbook of Logic and Proof Techniques for Computer Science]( "Handbook of Logic and Proof Techniques for Computer Science")
Handbook of Logic and Proof Techniques for Computer Science58,50 €![Fundamentals of Logic and Computation]( "Fundamentals of Logic and Computation")
Fundamentals of Logic and Computation44,99 €![Fundamentals of Logic and Computation]( "Fundamentals of Logic and Computation")
Fundamentals of Logic and Computation44,99 €![R-Calculus, V: Description Logics]( "R-Calculus, V: Description Logics")
R-Calculus, V: Description Logics132,99 €![Automated Reasoning with Analytic Tableaux and Related Methods]( "Automated Reasoning with Analytic Tableaux and Related Methods")
Automated Reasoning with Analytic Tableaux and Related Methods30,99 €![The P=np Question and Gödel's Lost Letter]( "The P=np Question and Gödel's Lost Letter")
The P=np Question and Gödel's Lost Letter74,99 €
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.
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.