Constraint logic programming for qualitative and quantitative constraint satisfaction problems

Ho Geun Lee, Ronald M. Lee, Gang Yu

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

AI and OR approaches have complementary strengths: AI in domain-specific knowledge representation and OR in efficient mathematical computation. Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems that include both qualitative and quantitative constraints. The CLP approach is contrasted with the Mixed Integer Programming (MIP) method from a model-theoretic view. Three relative advantages of CLP over MIP are analyzed: (1) representational economies for domain-specific heuristics, (2) partial solutions, and (3) ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP for comparison of the two approaches. The results exhibit those relative advantages of CLP with computational efficiency comparable to MIP.

Original languageEnglish
Pages (from-to)67-83
Number of pages17
JournalDecision Support Systems
Volume16
Issue number1
DOIs
Publication statusPublished - 1996 Jan 1

Fingerprint

Constraint satisfaction problems
Logic programming
Integer programming
Knowledge representation
Computational efficiency
Theoretical Models
Constraint satisfaction problem
Logic Programming
Constraint Satisfaction
Efficiency
Mixed integer programming
Programming

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Information Systems
  • Developmental and Educational Psychology
  • Arts and Humanities (miscellaneous)
  • Information Systems and Management

Cite this

@article{5e971ab5e8ca45b6b89ab08980286262,
title = "Constraint logic programming for qualitative and quantitative constraint satisfaction problems",
abstract = "AI and OR approaches have complementary strengths: AI in domain-specific knowledge representation and OR in efficient mathematical computation. Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems that include both qualitative and quantitative constraints. The CLP approach is contrasted with the Mixed Integer Programming (MIP) method from a model-theoretic view. Three relative advantages of CLP over MIP are analyzed: (1) representational economies for domain-specific heuristics, (2) partial solutions, and (3) ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP for comparison of the two approaches. The results exhibit those relative advantages of CLP with computational efficiency comparable to MIP.",
author = "Lee, {Ho Geun} and Lee, {Ronald M.} and Gang Yu",
year = "1996",
month = "1",
day = "1",
doi = "10.1016/0167-9236(94)00057-3",
language = "English",
volume = "16",
pages = "67--83",
journal = "Decision Support Systems",
issn = "0167-9236",
publisher = "Elsevier",
number = "1",

}

Constraint logic programming for qualitative and quantitative constraint satisfaction problems. / Lee, Ho Geun; Lee, Ronald M.; Yu, Gang.

In: Decision Support Systems, Vol. 16, No. 1, 01.01.1996, p. 67-83.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Constraint logic programming for qualitative and quantitative constraint satisfaction problems

AU - Lee, Ho Geun

AU - Lee, Ronald M.

AU - Yu, Gang

PY - 1996/1/1

Y1 - 1996/1/1

N2 - AI and OR approaches have complementary strengths: AI in domain-specific knowledge representation and OR in efficient mathematical computation. Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems that include both qualitative and quantitative constraints. The CLP approach is contrasted with the Mixed Integer Programming (MIP) method from a model-theoretic view. Three relative advantages of CLP over MIP are analyzed: (1) representational economies for domain-specific heuristics, (2) partial solutions, and (3) ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP for comparison of the two approaches. The results exhibit those relative advantages of CLP with computational efficiency comparable to MIP.

AB - AI and OR approaches have complementary strengths: AI in domain-specific knowledge representation and OR in efficient mathematical computation. Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems that include both qualitative and quantitative constraints. The CLP approach is contrasted with the Mixed Integer Programming (MIP) method from a model-theoretic view. Three relative advantages of CLP over MIP are analyzed: (1) representational economies for domain-specific heuristics, (2) partial solutions, and (3) ease of model revision. A case example of constraint satisfaction problems is implemented by MIP and CLP for comparison of the two approaches. The results exhibit those relative advantages of CLP with computational efficiency comparable to MIP.

UR - http://www.scopus.com/inward/record.url?scp=0029734555&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029734555&partnerID=8YFLogxK

U2 - 10.1016/0167-9236(94)00057-3

DO - 10.1016/0167-9236(94)00057-3

M3 - Article

AN - SCOPUS:0029734555

VL - 16

SP - 67

EP - 83

JO - Decision Support Systems

JF - Decision Support Systems

SN - 0167-9236

IS - 1

ER -