Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
London :
Springer London : Imprint: Springer,
2012.
|
| Edición: | 1st ed. 2012. |
| Colección: | SpringerBriefs in Computer Science,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
| Sumario: | 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. |
|---|---|
| Descripción Física: | X, 106 p. 16 illus. online resource. |
| ISBN: | 9781447140023 |
| ISSN: | 2191-5776 |