Abstract
Existing work on verifying knowledge-based systems (cf. [Lydiard, 1992], [Plant & Preece, 1996]) is focused on specific representation formalisms (usually production rules and KL-ONE like formalisms) and prove rather abstract properties of knowledge-based systems (so-called anomalies). One the one hand, these approaches make very strong meta-assumptions by assuming a specific representation formalism for describing the knowledge-based system. On the other hand, they do not make any (meta-) assumptions about the architecture (i.e., the general structure of a knowledge-based system) that can be used to describe a reasoning system. As a consequence, most of these approaches are situated at a different level of generality than our approach (cf. [Newell, 1982]).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2000). A Verification Framework for Knowledge-Based Systems. In: Problem-Solving Methods. Lecture Notes in Computer Science(), vol 1791. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44936-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-44936-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67816-8
Online ISBN: 978-3-540-44936-2
eBook Packages: Springer Book Archive