AI Expert
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Functional computations in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Mockingbird: a logical methodology for testing
Journal of Logic Programming - Logic programming applications
Analysis of constraint logic programs
Proceedings of the 1990 North American conference on Logic programming
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
An abstract machine for CLP(R)
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Concurrent constraint programming
Concurrent constraint programming
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
APL '79 Proceedings of the international conference on APL: part 1
Denotational abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The replacement operation for CLP modules
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Global analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strategic directions in constraint programming
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Optimizing compilation of CLP( R )
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Some Challenges for Constraint Programming
Constraints
Automated Strategies for Specializing Constraint Logic Programs
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
CL '00 Proceedings of the First International Conference on Computational Logic
Checking modes of HAL programs
Theory and Practice of Logic Programming
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
ETL Workflow Analysis and Verification Using Backwards Constraint Propagation
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
Convex hull abstractions in specialization of CLP programs
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
An abstract interpretation based combinator for modelling while loops in constraint programming
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
Central to constraint logic programming (CLP) languages is the notion of a global constraint solver which is queried to direct execution and to which constraints are monotonically added. We present a methodology for use in the compilation of CLP languages which is designed to reduce the overhead of the global constraint solver. This methododology is based on three optimizations. The first, refinement, involves adding new constraints, which in effect make information available earlier in the computation, guiding subsequent execution away from unprofitable choices. The second, removal, involves eliminating constraints from the solver when they are redundant. The last, reordering, involves moving constraint addition later and constraint removal earlier in the computation. Determining the applicability of each optimization requires sophisticated global analysis. These analyses are based on abstract interpretation and provide information about potential and definite interaction between constraints.