Abstract
This chapter develops a general view of the recursive learning procedure of Chapter 3 and presents a generalization of the technique. The main focus is on the basic search process underlying recursive learning. It is shown that the search process in recursive learning is a special instance of an AND/OR search. This leads to a basic reasoning scheme in Boolean networks based on AND/OR reasoning graphs. AND/OR reasoning graphs can identify implications and implicants in multi-level circuits so that basic concepts of two-level circuit theory can be extended and applied to multi-level circuits. This chapter elaborates properties of AND/OR reasoning graphs that are useful in solving design automation problems. Applications will be described in Chapters 5 and 6.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kunz, W., Stoffel, D. (1997). AND/OR Reasoning Graphs. In: Reasoning in Boolean Networks. Frontiers in Electronic Testing, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2572-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2572-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5176-2
Online ISBN: 978-1-4757-2572-8
eBook Packages: Springer Book Archive