A Proof Theory for Description Logics [electronic resource] /by Alexandre Rademaker.
by Rademaker, Alexandre [author.]; SpringerLink (Online service).
Material type:
BookSeries: SpringerBriefs in Computer Science: Publisher: London : Springer London : 2012.Description: X, 106 p. 16 illus. online resource.ISBN: 9781447140023.Subject(s): Computer science | Computer Science | Mathematical Logic and Formal Languages | Mathematics of ComputingDDC classification: 005.131 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA8.9-QA10.3 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
| RL1-803 Measurements in Wound Healing | HB135-147 Tools for Computational Finance | TJ210.2-211.495 Snake Robots | QA8.9-QA10.3 A Proof Theory for Description Logics | RD598.5-598.7 Noninvasive Vascular Diagnosis | QA403.5-404.5 Complex Analysis and Differential Equations | TA177.4-185 Re-engineering of Products and Processes |
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.
There are no comments for this item.