Sciweavers

35 search results - page 2 / 7
» On the Compilation of Programs into their Equivalent Constra...
Sort
View
CP
2003
Springer
13 years 10 months ago
Box Constraint Collections for Adhoc Constraints
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
Chi Kan Cheng, Jimmy Ho-Man Lee, Peter J. Stuckey
AGP
1998
IEEE
13 years 9 months ago
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
Roberto Bagnara, Peter Schachte
POPL
2009
ACM
14 years 5 months ago
Equality saturation: a new approach to optimization
Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed t...
Ross Tate, Michael Stepp, Zachary Tatlock, Sorin L...
CSCLP
2008
Springer
13 years 7 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
LCTRTS
2000
Springer
13 years 8 months ago
Automatic Validation of Code-Improving Transformations
This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compi...
Robert van Engelen, David B. Whalley, Xin Yuan