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.
| ISBN: | 9781447140016 |
| Publication date: | 18th May 2012 |
| Author: | Alexandre Rademaker |
| Publisher: | Springer an imprint of Springer London |
| Format: | Paperback |
| Pagination: | 106 pages |
| Series: | Springer Briefs in Computer Science |
| Genres: |
Mathematical theory of computation Maths for computer scientists |
Description Logics (DLs) is a family of formalisms used to represent knowledge of a domain. They are equipped with a formal logic-based semantics.
A Proof Theory for Description Logics features in the following genres: Mathematical theory of computation, Maths for computer scientists
Paperback. Not Available.
A Proof Theory for Description Logics was written by Alexandre Rademaker and published by Springer an imprint of Springer London
A Proof Theory for Description Logics has 106 pages
Yes it is part of Springer Briefs in Computer Science series