16 citations · 60 across the 12 of their papers we have counts for
3 papers · 2 filters
Possibilistic Constraint Satisfaction Problems or "How to handle soft constraints?"
Thomas Schiex
Many AI synthesis problems such as planning or scheduling may be modelized as constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding any consi…
Penalty logic and its Link with Dempster-Shafer Theory
Florence Dupin de Saint-Cyr, Jerome Lang, Thomas Schiex
Penalty logic, introduced by Pinkas, associates to each formula of a knowledge base the price to pay if this formula is violated. Penalties may be used as a criterion for selecting…
A Constraint Satisfaction Approach to Decision under Uncertainty
Helene Fargier, Jerome Lang, Roger Martin-Clouaire +1
The Constraint Satisfaction Problem (CSP) framework offers a simple and sound basis for representing and solving simple decision problems, without uncertainty. This paper is devote…