A Proof Theory for Description Logics

By: Alexandre Rademaker

Write A Review

eBook | 29 December 2015

At a Glance

ePUB
106 Pages

eBook

RRP $84.99

$76.99

or 4 interest-free payments of $19.25 with

Instant Digital Delivery to your Booktopia Reader App

Read on

Android

eReader

Desktop

IOS

Windows

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.