A Proof Theory for Description Logics [electronic resource] / by Alexandre Rademaker.
Tipo de material: TextoSeries SpringerBriefs in Computer Science | SpringerBriefs in Computer ScienceEditor: London : Springer London : Imprint: Springer, 2012Descripción: X, 106 p. 16 illus. online resourceTipo de contenido:- text
- computer
- online resource
- 9781447140023
- SpringerLink (Online service)
- 005.131 23
- QA8.9-QA10.3
Introduction -- Background -- Sequent Calculus for ALC -- Comparing SCalc with other ALC Deduction Systems -- Natural Deduction for ALC.-A Proof Theory for ALCQI -- Proofs and Explanations -- A Prototype Theorem Prover -- Conclusion.
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.
ZDB-2-SCS
No hay comentarios en este titulo.