Abstract
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem solver (e.g. a propositional Boolean SAT tool). This approach, however, requires models with substantial duplication of digital circuits. In Constraint Logic Programming, the use of extra values in the digital signals (other than the usual 0/1) was proposed to reflect their dependency on some faulty gate. In this paper we present an extension of this modelling approach, using set variables to denote dependency of the signals on sets of faults, to model different circuits problems. We then show the importance of propagating constraints on sets cardinality, by comparing Cardinal, a set constraint solver that we implemented, with a simpler version that propagates these constraints similarly to Conjunto, a widely available set constraint solver. Results show speed ups of Cardinal of about two orders of magnitude, on a set of diagnostic problems.
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
F. Azevedo and P. Barahona Benchmarks for Differential Diagnosis, at URL http://www-ssdi.di.fct.unl.pt/~fa/differential-diagnosis/benchmarks.html, 1998.
F. Azevedo and P. Barahona. Constraints over an Eight-Valued Logic to Differentiate Diagnostic Theories, to appear in Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000), W. Horn (Ed.), IOS Press, Amsterdam, 2000.
F. Benhamou, Interval Constraint Logic Programming, in Constraint Programming: Basics and Trends, LNCS 910, A. Podelski (Ed.), Springer, March 1995.
ECRC, ECLiPSe (a) user manual, (b) extensions of the user manual, Technical Report, ECRC, 1994.
T. Frühwirth, Constraint Handling Rules, in Constraint Programming: Basics and Trends, LNCS 910, A. Podelski (Ed.), Springer, 1995.
C. Gervet, Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language, Constraints, vol. 1(3), Kluwer, pp. 191–244, March 1997.
C. Gervet, personal communication
T. Gruning, U. Mahlstedt, H. Koopmeiners, DIATEST: A Fast Diagnostic Test Pattern Generator for Combinational Circuits, Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD91), pp. 194–197, 1991
I. Hartantol, V. Boppana, W.K. Fuchs, J.H. Patel, Diagnostic Test Pattern Generation For Sequential Circuits, Proc. 15th VLSI Test Symposium (VTS), Monterey, pp. 196–202, 1997.
ISCAS. Special Session on ATPG, Proc. IEEE Symposium on Circuits and Systems, 1985.
J. Jaffar and J.-L. Lassez. Constraint Logic Programming, Proceedings of the 14th ACM Symposium on Principles of Programming Languages, pp. 111–119, 1987.
J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey, Journal of Logic Programming, 19(20):503–581, 1994.
V. Manquinho and J. Marques Silva, On using satisfiability based pruning techniques in covering algorithms, Proc. ACM/IEEE Design, Automation and Test in Europe Conf. 2000.
I. Pomeranz, S.M. Reddy, A Diagnostic Test Generation Procedure for Synchronous Sequential Circuits based on Test Elimination, International Test Conference (ITC98). Washington, D.C., USA, pp. 1074–1083, 1998.
L. G. Silva, L. M. Silveira and J. P. Marques-Silva, Algorithms for Solving Boolean Satisfiability in Combinational Circuits, in Proc. of the IEEE/ACM Design and Test in Europe Conference (DATE), 1999.
H. Simonis. Test Generation using the Constraint Logic Programming Language CHIP, in Proc. of the 6th International Conf. on Logic Programming, MIT Press, pp 101–112, 1989.
H. Simonis. Constraint Logic Programming Language as a Digital Circuit Design Tool, Thesis, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azevedo, F., Barahona, P. (2000). Modelling Digital Circuits Problems with Set Constraints. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_28
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive