Optimization and relaxation in constraint logic languages

Kannan Govindarajan; Bharat Jayaraman; Surya Mantha

doi:10.1145/237721.237735

Optimization and relaxation in constraint logic languages

Kannan Govindarajan
, Bharat Jayaraman
, Surya Mantha

Department of Computer Science and Engineering

SUNY Buffalo

Research output: Contribution to journal › Conference article › peer-review

17 Scopus citations

Abstract

A logical framework is presented for performing optimization and relaxation in a constraint logic programming language. The proposed framework is called preference logic programming (PLP). The PLP paradigm is extended with facilities to formulate relaxation problems in a natural manner. Finally, it is highlighted that the concept of preference provides a unifying framework for formulating optimization as well as relaxation problems.

Original language	English
Pages (from-to)	91-103
Number of pages	13
Journal	Conference Record of the Annual ACM Symposium on Principles of Programming Languages
DOIs	https://doi.org/10.1145/237721.237735
State	Published - 1996
Event	Proceedings of the 1996 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - St.Petersburg, FL, USA Duration: Jan 21 1996 → Jan 24 1996

Access to Document

10.1145/237721.237735

Cite this

@article{0a5c2ca5213a48f1960de1ca24a4ada8,

title = "Optimization and relaxation in constraint logic languages",

abstract = "A logical framework is presented for performing optimization and relaxation in a constraint logic programming language. The proposed framework is called preference logic programming (PLP). The PLP paradigm is extended with facilities to formulate relaxation problems in a natural manner. Finally, it is highlighted that the concept of preference provides a unifying framework for formulating optimization as well as relaxation problems.",

author = "Kannan Govindarajan and Bharat Jayaraman and Surya Mantha",

year = "1996",

doi = "10.1145/237721.237735",

language = "English",

pages = "91--103",

journal = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",

issn = "0730-8566",

publisher = "Association for Computing Machinery ",

note = "Proceedings of the 1996 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages ; Conference date: 21-01-1996 Through 24-01-1996",

}

TY - JOUR

T1 - Optimization and relaxation in constraint logic languages

AU - Govindarajan, Kannan

AU - Jayaraman, Bharat

AU - Mantha, Surya

PY - 1996

Y1 - 1996

N2 - A logical framework is presented for performing optimization and relaxation in a constraint logic programming language. The proposed framework is called preference logic programming (PLP). The PLP paradigm is extended with facilities to formulate relaxation problems in a natural manner. Finally, it is highlighted that the concept of preference provides a unifying framework for formulating optimization as well as relaxation problems.

AB - A logical framework is presented for performing optimization and relaxation in a constraint logic programming language. The proposed framework is called preference logic programming (PLP). The PLP paradigm is extended with facilities to formulate relaxation problems in a natural manner. Finally, it is highlighted that the concept of preference provides a unifying framework for formulating optimization as well as relaxation problems.

UR - https://www.scopus.com/pages/publications/0029707499

U2 - 10.1145/237721.237735

DO - 10.1145/237721.237735

M3 - Conference article

AN - SCOPUS:0029707499

SN - 0730-8566

SP - 91

EP - 103

JO - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

JF - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

T2 - Proceedings of the 1996 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Y2 - 21 January 1996 through 24 January 1996

ER -

Optimization and relaxation in constraint logic languages

Abstract

Access to Document

Other files and links

Fingerprint

Cite this