125 search results - page 19 / 25 » Boolean Satisfiability with Transitivity Constraints |
CP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
CPAIOR
2010
Springer
13 years 9 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
ICCAD
2007
IEEE
14 years 7 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
AI
2011
Springer
13 years 6 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
VISUAL
2005
Springer
14 years 4 months ago
2005
Springer
The paper describes a modular procedure for automatic correction of redeye artifact in images of unknown origin, maintaining the natural appearance of the eye. First, a smart color...