A Proof Theory for Description Logics (SpringerBriefs in Computer Science)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into Bookshare to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2012
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781447140023
- Related ISBNs:
- 9781447140016
- Publisher:
- Springer London, Limited
- Date of Addition:
- 07/14/18
- Copyrighted By:
- Springer
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics, Philosophy
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Alexandre Rademaker
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics
- in Philosophy