Abstracting numeric constraints with Boolean functions

Information Processing Letters

Volumn 75, Issue 1, 2000, Pages 17-23

  Howe, Jacob M ^a   King, Andy ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; SET THEORY; TABLE LOOKUP; THEOREM PROVING;

GROUNDNESS ANALYSIS;

CONSTRAINT THEORY;

EID: 0034227998     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00081-8     Document Type: Article

References (9)

1. Armstrong T., Marriott K., Schachte P., Søndergaard H. Two classes of Boolean functions for dependency analysis. Sci. Comput. Programming. Vol. 31:(1):1998;3-45.
2. Baker N., Søndergaard H. Definiteness analysis for CLP( R ). Australian Comput. Sci. Commun. Vol. 15:(1):1993;321-332.
3. Codish M., Demoen B. Analyzing logic programs using "Prop"-ositional logic programs and a magic wand. J. Logic Programming. Vol. 25:(3):1995;249-274.
4. de la Banda M. García. Independence, global analysis, and parallelism in dynamically scheduled constraint logic programming. Ph.D. Thesis:1994;Universidad Politécnica de Madrid.
5. de la Banda M. García, Hermenegildo M., Bruynooghe M., Dumortier V., Janssens G., Simoens W. Global analysis of constraint logic programs. ACM Trans. Programming Languages Systems. Vol. 18:(5):1996;564-614.
6. A. Heaton, M. Abo-Zaed, M. Codish, A. King, A simple polynomial groundness analysis for logic programs, J. Logic Programming, forthcoming.
7. Heintze N., Jaffar J., Michaylov S., Stuckey P., Yap R. The CLP( R ) Programmer's Manual Version 1.1. 1991.
8. Howe J.M., King A. Implementing groundness analysis with definite Boolean functions. Smolka G. European Symposium on Programming. Lecture Notes in Computer Science. Vol. 1782:2000;200-214 Springer, Berlin.
9. King A., Smaus J., Hill P. Quotienting share for dependency analysis. Swierstra S.D. European Symposium on Programming. Lecture Notes in Computer Science. Vol. 1576:1999;59-73 Springer, Berlin.