Non-Standard Inferences in Description Logics : From Foundations and Definitions to Algorithms and Analysis - Ralf KÃ¼sters

Instant online reading.
Don't wait for delivery!

Non-Standard Inferences in Description Logics

From Foundations and Definitions to Algorithms and Analysis

By: Ralf KÃ¼sters

Write A Review

Paperback | 25 July 2001

At a Glance

Paperback
264 Pages

Dimensions(cm)
23.5 x 15.24 x 1.27

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Mathematics Mathematical Foundation Mathematical Logic Philosophy Epistemology & The Theory of Knowledge Computing & I.T.Computer Science Artificial Intelligence Expert Systems & Knowledge-Based Systems Medicine Medicine in General

Computer Programming & Software Development Software Engineering Mathematical Theory of Computation

Introduction	p. 1
Description Logics	p. 11
History	p. 11
Syntax and Semantics of Description Logics	p. 15
Concept Descriptions	p. 16
Terminologies (TBoxes)	p. 21
World Descriptions (ABoxes)	p. 25
Standard Inferences	p. 26
Decision Algorithms	p. 28
Non-Standard Inferences	p. 33
LCS and MSC	p. 34
Definition of LCS and MSC	p. 34
Applications of LCS and MSC	p. 38
Previous Results	p. 41
New Results	p. 42
Matching	p. 45
Definition of Matching Problems	p. 46
Applications of Matching	p. 49
Solutions of Matching Problems	p. 52
Previous Results	p. 63
New Results	p. 64
The Underlying Techniques	p. 68
Other Non-Standard Inferences	p. 70
Characterizing Subsumption	p. 73
Subsumption in ALNS	p. 73
A Graph-Based Characterization of Subsumption	p. 74
A Description-Based Characterization of Subsumption	p. 88
Subsumption in ALN^*	p. 89
Subsumption in ALE	p. 96
A Tree-Based Characterization of Subsumption	p. 97
A Description-Based Characterization of Subsumption	p. 104
LCS and MSC	p. 107
LCS for ALNS-Concept Descriptions	p. 107
The LCS in ALNS	p. 108
The LCS in LS	p. 112
LCS and MSC for ALN^*-Concept Descriptions	p. 125
Computing the LCS for ALN^*-Concept Descriptions	p. 126
Computing the MSC for ALN^*-Concept Descriptions	p. 127
LCS for ALE-Concept Descriptions	p. 151
Matching	p. 153
Matching in ALNS	p. 153
Deciding the Solvability of Matching Problems	p. 154
Computing Minimal i-Complete Sets	p. 156
Computing Minimal d-Complete Sets	p. 161
Matching in ALN^*	p. 169
Deciding the Solvability of Matching	p. 169
Computing Minimal i-Complete Sets	p. 176
Matching in ALE	p. 180
Matching in EL	p. 180
Equivalence of ALE-Concept Descriptions	p. 200
Deciding the Solvability of Matching in FLE	p. 205
Deciding the Solvability of Matching in ALE	p. 209
Computing i-Minimal Matchers in ALE	p. 219
Computing d-Minimal Matchers in ALE	p. 225
Conclusion	p. 229
References	p. 235
Index	p. 245
Table of Contents provided by Publisher. All Rights Reserved.

Non-Standard Inferences in Description Logics

From Foundations and Definitions to Algorithms and Analysis

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

Quantum Control of Hybrid Spin-Oscillator Systems

Springer Theses

Mathematics and Computation in Music

10th International Conference, MCM 2026, Annandale-on-Hudson, NY, USA, June 23-26, 2026, Proceedings

Discrete Mathematics for Computing

Grassroots

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

AI Engineering

Building Applications with Foundation Models

Effective Machine Learning Teams

Best Practices for ML Practitioners

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Nonlinear Analysis for Human Movement Variability

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Theory of Computation for Software Developers

Theory of Computation for Software Developers

AI for Decision Intelligence in Critical Systems

Advances in Applied Mathematics

AI for Decision Intelligence in Critical Systems

Advances in Applied Mathematics

AI and Blockchain in Smart Grids

Fundamentals, Methods, and Applications

Attack-and-Defense Games for Control Systems

Analysis and Synthesis

Machine Learning Interviews

Kickstart Your Machine Learning and Data Career

Introduction to Modern Cryptography

Revised Third Edition

Computability and Computational Explanation

Elements in the Philosophy of Mathematics

Computability and Computational Explanation

Elements in the Philosophy of Mathematics

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Graphical Models and Causal Discovery with Python

100 Exercises for Building Logic

This product is categorised by