A Proof Theory for Description Logics
Nonfiction, Science & Nature, Mathematics, Logic, Computers, Database Management, Data Processing, General Computing
| Author: | Alexandre Rademaker | ISBN: | 9781447140023 |
| Publisher: | Springer London | Publication: | May 17, 2012 |
| Imprint: | Springer | Language: | English |
| Author: | Alexandre Rademaker |
| ISBN: | 9781447140023 |
| Publisher: | Springer London |
| Publication: | May 17, 2012 |
| Imprint: | Springer |
| Language: | English |
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.
