56 search results - page 1 / 12 » Boolean Constraint Solving Using clp(FD) |
64
Voted
SLP
1993
15 years 7 days ago
1993
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
101
Voted
FLAIRS
2003
15 years 9 days ago
2003
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
81
Voted
ICLP
1993
Springer
15 years 3 months ago
1993
Springer
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
85
Voted
ICTAI
2008
IEEE
15 years 5 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
ECAI
2008
Springer
15 years 21 days ago
2008
Springer
Abstract. We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences ...