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.
- CLARK, K. 1978. Negation as failure. In Logic and Databases. Plenum Press, New York, 293-322.Google Scholar
- DINCBAS, M., VAN HENTENRYCK, P., SIMONIS, H., AGGOUN, A., GR~, T., AND BERTHIER, F. 1988. The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems FGCS-88. ICOT, Tokyo, 693-702.Google Scholar
- FAGES, F. 1993. On the semantics of optimization predicates in CLP languages. Position Paper. First Workshop on Principles and Practice of Constraint Programming.Google Scholar
- GANGULY, S., GRECO, S., AND ZANIOLO, C. 1991. Minimum and maximum predicates in logic programming, in Proceedings of the lOth Principles of Databases Symposium. 154-163. Google Scholar
- GORLICK, M. M., KESSELMAN, C. F., MAROTTA, D. A., AND PARKER, D.S. 1990. Mockingbird: A logical me~hoelolob~ ~*or ~es~x-x~. g. Logic Program. ~, i--~, 9g-llO. Google Scholar
- HEINTZE, N. C., MICHAYLOV, S., STUCKEY, P. J., AND YAP, R. 1989. On recta-programming in CLP(~). In Proceedings of the North American Conference on Logic Programming. IEEE, New York, 52-68.Google Scholar
- JAFFAR, J., AND LASSEZ, J. -L. 1987. Constraint logic programming. In Proceedings of the 14th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, 111-119. Google Scholar
- JAFFAR, J., MICHAYLOV, S., STUCKEY, P., AND YAP, R. 1992a. The CLP(~) language and system. ACM Trans. Program. Lang. Syst. 14, 3, 339-395. Google Scholar
- JAFFAR, J., MICHAYLOV, S., STUCKEY, P., AND YAP, R. 1992b. An abstract machine for CLP(~). In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 128-139. Google Scholar
- KLEENE, S.C. 1952. Introduction to Metamathematics. North-Holland, Amsterdam.Google Scholar
- KUNEN, K. 1987. Negation in logic programming. J. Logic Program. 4, 3, 289-308. Google Scholar
- LASSEZ, C., MCALOON, K., AND YAP, R. 1987. Constraint logic programming and options trading. IEEE Exp. 2, 1, 42-50.Google Scholar
- MAHER, M. J., AND STUCKEY, P.J. 1989. Expanding query power in constraint logic programming. in Proceedings of the North American Conference on Logic Programming 89. IEEE, New York, 20-36.Google Scholar
- MCALOON, K., AND TRETKOFF, 'C. 1989. 2LP: A logic programming and linear programming system. Tech. Rep. 1989-21, CIS Dept., Brooklyn College of CUNY.Google Scholar
- NAISH, L. 1986. Negation and Control in Prolog. Lecture Notes in Computer Science, vol. 238. Springer-Verlag, New York. Google Scholar
- SIMONIS, H., AND DINCBAS, M. 1987. Using an extended Prolog for digital circuit design. In the IEEE International Workshop on AI Applications to CAD Systems for Electronics. IEEE, New York, 165-188.Google Scholar
- STUCKEY, P.J. 1991. Constructive negation for constraint logic programming. In Proceedings of the 5th IEEE Logic in Computer Science Symposium. IEEE, New York, 328-341.Google Scholar
Index Terms
Semantics of constraint logic programs with optimization
Recommendations
Semiring-based constraint logic programming: syntax and semantics
We extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraints. This allows us to perform in the same language both constraint solving and optimization. In fact, constraints based on semirings are able to model ...
Temporal reasoning in a meta constraint logic programming architecture
TIME '96: Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)Constraint Logic Programming (CLP) is a powerful programming paradigm combining the advantages of Logic Programming and the efficiency of constraint solving. However, CLP presents some limitations in dealing with temporal reasoning. First, it uses an "...








Comments