Semantics of constraint logic programs with optimization

Authors:
Kim Marriott;Peter J. Stuckey
Affiliations:
Monash Univ., Clayton, Australia;Univ. of Melbourne, Parkville, Australia
Venue:
ACM Letters on Programming Languages and Systems (LOPLAS)
Year:
1993

Citing 7
Cited 4

Negation and control in Prolog

Negation and control in Prolog
Negation in logic programming

Journal of Logic Programming
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Mockingbird: a logical methodology for testing

Journal of Logic Programming - Logic programming applications
Minimum and maximum predicates in logic programming

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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

Optimization and relaxation in constraint logic languages

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques

IEEE Transactions on Knowledge and Data Engineering
Adding Linear Constraints over Real Numbers to Curry

FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Semantic optimization techniques for preference queries

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many applications of constraint logic programming (CLP) languages require not only testing if a set of constraints is satisfiable, but also finding the optimal solution which satisfies them. Unfortunately, the standard declarative semantics for CLP languages does not consider optimization but only constraint satisfaction. Here we give a model theoretic semantics for optimization, which is a simple extension of the standard semantics, and a corresponding operational semantics, which may be efficiently implemented.