Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

A Proof Theory for Description Logics, Paperback / softback Book

A Proof Theory for Description Logics Paperback / softback

Part of the SpringerBriefs in Computer Science series

Paperback / softback

Description

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.

Information

Other Formats

Save 18%

£49.99

£40.99

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the SpringerBriefs in Computer Science series  |  View all