Adding constraint solving to mercury

Authors:
Ralph Becket;Maria Garcia de la Banda;Kim Marriott;Zoltan Somogyi;Peter J. Stuckey;Mark Wallace
Affiliations:
Department of Computer Science and Software Engineering, The University of Melbourne, Australia;School of Computer Science and Software Engineering, Monash University, Australia;School of Computer Science and Software Engineering, Monash University, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Australia;School of Computer Science and Software Engineering, Monash University, Australia
Venue:
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Year:
2006

Citing 3
Cited 6

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Metastructures versus Attributed Variables in the Context of Extensible Unification

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
An Overview of HAL

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
G12 - Towards the Separation of Problem Modelling and Problem Solving

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Attributed Data for CHR Indexing

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Typing linear constraints

ACM Transactions on Programming Languages and Systems (TOPLAS)
A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Research perspectives for logic and deduction

Reasoning, Action and Interaction in AI Theories and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The logic programming language Mercury is designed to support programming in the large. Programmer declarations in conjunction with powerful compile-time analysis and optimization allow Mercury programs to be very efficient. The original design of Mercury did not support constraint logic programming (CLP). This paper describes the extensions we added to Mercury to support CLP. Unlike similarly motivated extensions to Prolog systems, our objectives included preserving the purity of Mercury programs as much as possible, as well as avoiding any impact on the efficiency of non-CLP predicates and functions.