AI Chat AI Image Generator AI Video Text to Speech

A Proof Theoretic View of Constraint Programming

10/20/1998

∙

by Krzysztof R. Apt, et al.

∙

∙

We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for linear constraints over interval domains, and illustrate their use by analyzing the constraint propagation process for the SEND + MORE = MONEY puzzle. We also show how this approach allows one to build new constraint solvers.

page 1

page 2

page 3

page 4

research

∙ 06/05/2009

The CIFF Proof Procedure for Abductive Logic Programming with Constraints: Theory, Implementation and Experiments

We present the CIFF proof procedure for abductive logic programming with...

0 P. Mancarella, et al. ∙

research

∙ 05/22/2009

Scenario-based Stochastic Constraint Programming

To model combinatorial decision problems involving uncertainty and proba...

0 Suresh Manandhar, et al. ∙

research

∙ 08/04/2020

Modular Constraint Solver Cooperation via Abstract Interpretation

Cooperation among constraint solvers is difficult because different solv...

0 Pierre Talbot, et al. ∙

research

∙ 01/21/2014

Domain Views for Constraint Programming

Views are a standard abstraction in constraint programming: They make it...

0 Pascal Van Hentenryck, et al. ∙

research

∙ 10/12/2015

The Inductive Constraint Programming Loop

Constraint programming is used for a variety of real-world optimisation ...

0 Christian Bessiere, et al. ∙

research

∙ 12/20/2021

A Constraint Programming Approach to Weighted Isomorphic Mapping of Fragment-based Shape Signatures

Fragment-based shape signature techniques have proven to be powerful too...

0 Thierry Petit, et al. ∙

research

∙ 07/10/2020

Half-checking propagators

Propagators are central to the success of constraint programming, that i...

0 Mikael Zayenz Lagerkvist, et al. ∙