Abstract
The propose-and-revise strategy is suitable for deriving values for a set of parameters. It makes possible an efficient, sequential determination of the parameter values, even when the search space is locally or globally under- or over-determined or when cyclic relationships exist. Its flexibility results from the fact that the parameter values first proposed can be corrected at any time with “revision knowledge” if this turns out to be necessary. It is suitable for cyclic parameter relationships because loops can be broken by taking a cyclic parameter as a starting parameter and estimating its value. If a contradiction occurs in the subsequent calculations on account of the cyclic relations, the parameter value is raised or lowered (Fig. 23.1).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hartinger, M. and Wedel, T.: Stand des Expertensystems PAREX-CO zur wissensbasierten dynamischen Konfiguration von Parametern des PPS-Modularprogramms COPICS, Memo 1/1990, University of Erlangen-Nuremberg, Department of Business Computer Science, 1990.
Marcus, S.: SALT: A Knowledge Acquisition Tool for Propose-and-Revise Systems, in Marcus, S. (ed.): Automating Knowledge Acquisition for Expert Systems, Chap. 4, Kluwer Academic Publishers, 1988 (a).
Marcus, S., Stout, J. and McDermott, J.: VT: An Expert Elevator Designer That Uses Knowledge-Based Backtracking, AI Magazine 9, 95–111, 1988 (b).
Marcus, S. and McDermott, J.: SALT: A Knowledge Acquisition Language for Propose-and-Revise Systems, AI Journal 39, 1–38, 1989.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Puppe, F. (1993). Propose and Revise. In: Systematic Introduction to Expert Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77971-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-77971-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77973-2
Online ISBN: 978-3-642-77971-8
eBook Packages: Springer Book Archive