Sciweavers

1264 search results - page 54 / 253
» The framework approach for constraint satisfaction
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
IJCAI
2007
15 years 7 months ago
A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantic...
Carlos Iván Chesñevar, Guillermo Ric...
180
Voted
CP
2003
Springer
15 years 11 months ago
Semi-automatic Modeling by Constraint Acquisition
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
Remi Coletta, Christian Bessière, Barry O'S...
ANOR
2011
96views more  ANOR 2011»
15 years 1 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder
KI
2002
Springer
15 years 5 months ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos