Everything About ___
Live briefing

Everything about Constraint logic programming

Logic programming with constraint satisfaction

Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is A(X,Y) :- X+Y>0, B(X), C(Y). In this clause, X+Y>0 is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Constraint logic programmingA 5-minute orientation
  2. Skim a recent paper: Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problemInfluential work since 2022
  3. Pick up a classic book: Constraint logic programming using ECLiPSeThe most-reprinted book on the subject
  4. Read the landmark paper: Constraint logic programming: a surveyCited 818 times
  5. Go sideways: Constraint satisfactionA closely related topic
  6. Go sideways: Constraint programmingA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Overview
  2. Semantics
  3. Terms and conditions
  4. The constraint store
  5. Labeling
  6. Program reformulations
  7. Constraint handling rules
  8. Bottom-up evaluation
  9. Concurrent constraint logic programming
  10. Applications
  11. History

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics