Abstract
Future redundant inequalities in a constraint logic program are those that are guaranteed to be subsumed after no more than one subsequent procedure call, usually in the context of a recursive procedure. It has been noted that such inequalities need only be tested for consistency with the current constraint set, thus resulting in dramatic savings in execution speed and space usage. We generalize the notion of future redundancy in a number of ways and thus broaden its applicability. Thus we show how to dramatically improve the performance of a wider class of programs that rely heavily on linear inequalities.
This research is supported in part by the National Science Foundation Grant #CCR-9308631.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. An abstract machine for CLP(\(\mathcal{R}\)). In Proceedings of the ACM SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), San Francisco, pages 128–139, June 1992.
Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(\(\mathcal{R}\)) language and system. A CM Transactions on Programming Languages and Systems (TOPLAS), 14(3):339–395, July 1992.
Niels Jørgensen, Kim Marriott, and Spiro Michaylov. Some global compile-time optimizations for CLP(\(\mathcal{R}\)). In Vijay Saraswat and Kazunori Ueda, editors, Logic Programming: Proceedings of the 1991 International Symposium, pages 420–434, San Diego, CA, October 1991. MIT Press.
Kim Marriott and Harald Søndergaard. Analysis of constraint logic programs. In Saumya Debray and Manuel Hermenegildo, editors, Proc. of the 1990 North American Conference on Logic Programming, pages 521–540, Austin, TX, 1990. MIT Press.
Kimbal G. Marriott and Peter J. Stuckey. The 3 R's of optimizing constraint logic programs: Refinement, removal and reordering. In Proc. ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), Charleston, NC, January 1993.
Andrew D. McDonald, Peter J. Stuckey, and Roland H. C. Yap. Redundancy of variables in CLP(\(\mathcal{R}\)). In Logic Programming: Proceedings of the 1993 International Symposium, Vancouver, October 1993. MIT Press.
Spiro Michaylov. Design and Implementation of Practical Constraint Logic Programming Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, August 1992. Available as technical report CMU-CS-92-168.
Spiro Michaylov. Optimizing CLP(\(\mathcal{R}\)) programs by reordering subgoals. Technical report, Department of Computer and Information Science, The Ohio State University, May 1994.
William H. Winsborough. Path-dependent reachability analysis for multiple specialization. In Logic Programming: Proceedings of the North American Conference, pages 133–153, Cleveland, OH, USA, November 1989. MIT Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michaylov, S. (1994). Repeated redundant inequalities in constraint logic programming. In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016851
Download citation
DOI: https://doi.org/10.1007/BFb0016851
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58403-2
Online ISBN: 978-3-540-48699-2
eBook Packages: Springer Book Archive