Abstract
A rewriting based method to design circuits on FPLA electronic devices is presented. It is an improvement of our previous work. In comparison with this latter, the number of boolean vectors generated during the design process is reduced. This is done thanks to new forms of rewriting rules denoting new interesting properties on boolean vectors, associated to boolean products. Only boolean products which are implicants of the circuit to design are computed. Thus, this new design process is more efficient than the previous one.
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.
References
N. Andrianarivelo, W. Bousdira, J. Chabin, and Z. Maazouzi. Designing FPLA combinational circuits by conditional rewriting. In H. Prade, editor, John Wiley and Sons, pages 373–377, Brighton, UK, 1998. 13th European Conference on Artificial Intelligence.
N. Andrianarivelo, W. Bousdira, and J-M. Talbot. On theorem-proving in Horn theories with built-in algebras. In J. Calmet, J.A. Campbell, and J. Pfalzgraf, editors, Lecture Notes in Computer Science, volume 1138, pages 320–338, Steyr, Austria, 1996. Third International Conference on Artificial Intelligence and Symbolic Computation.
N. Dershowitz and J-P. Jouannaud. Rewriting Systems. In J. Van Leuven, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers North-Holland, 1990.
P.R. Halmos. Lectures Notes on Boolean Algebras. Springer, Berlin, 1974.
Randy H. Katz. Contemporary logic design. Benjamin Cummings/Addison Wesley Publishing Company, 1993.
C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with Symbolic Constraints. Revue Fran,caise d'Intelligence Artificielle, 4(3):9–52, 1990. Special issue on Automatic Deduction.
G. Smolka. Logic Programming over Polymorphically Order-Sorted Types. PHD Thesis, Universitat Kaiserslautern, FB Informatik, West Germany, 1989.
John F. Wakerly. Digital Design Principles and Practices. Prentice Hall International Editions, 1991.
Ingo Wegener. The Complexity of Boolean Functions. J. Wiley and Sons, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maazouzi, Z., Andrianarivelo, N., Bousdira, W., Chabin, J. (2001). CDR: A Rewriting Based Tool to Design FPLA Circuits. In: Campbell, J.A., Roanes-Lozano, E. (eds) Artificial Intelligence and Symbolic Computation. AISC 2000. Lecture Notes in Computer Science(), vol 1930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44990-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-44990-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42071-2
Online ISBN: 978-3-540-44990-4
eBook Packages: Springer Book Archive