
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Description logics (DLs) are used to represent structured knowledge. Inference services testing consistency of knowledge bases and computing subconcept/superconcept hierarchies are the main feature of DL systems. Intensive research during the last fifteen years has led to highly optimized systems that allow to reason about knowledge bases efficiently. However, applications often require additional non-standard inferences to support both the construction and the maintenance of knowledge bases, thus making the inference procedures again incomplete. This book, which is a revised version of the author's PhD thesis, constitutes a significant step to fill this gap by providing an excellent formal foundation of the most prominent non-standard inferences. The descriptions given include precise definitions, complete algorithms and thorough complexity analysis. With its solid foundation, the book also serves as a basis for future research.
This volume presents foundational research in theoretical computer science presented at the 25th International Symposium, MFCS 2000. The proceedings cover a range of topics including algorithms, formal languages, logic, and complexity theory, reflecting the state of the art in these fields at the turn of the millennium. The papers included are the result of rigorous peer review, offering insights into the mathematical underpinnings of computation.
As a collection of proceedings from a significant international symposium, this book serves as a valuable archival resource for researchers in theoretical computer science. The topics covered, such as algorithms, formal languages, and logic, indicate a focus on foundational and advanced mathematical concepts relevant to the field. The inclusion of complexity analysis suggests a rigorous, academic approach, likely appealing to a specialist audience of computer scientists and mathematicians.
Page Count:
254
Publication Date:
2000-01-01
Publisher:
Springer-Verlag Berlin Heidelberg
ISBN-10:
8354044610
ISBN-13:
9788354044611
No comments yet. Be the first to share your thoughts!