2266 search results - page 311 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
133
Voted
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
130
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
151
Voted
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
132
Voted
CAV
2010
Springer
15 years 7 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
161
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...