A Proof Theory for Description Logics
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 re...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
London :
Springer London : Imprint: Springer,
2012.
|
| Series: | SpringerBriefs in Computer Science,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
| Summary: | 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. |
|---|---|
| Physical Description: | X, 106 p. 16 illus. online resource. |
| ISBN: | 9781447140023 |
| ISSN: | 2191-5768 |
