971 search results - page 4 / 195 » Approximate Satisfiability and Equivalence |
188
click to vote
JUCS
2010
15 years 4 months ago
2010
: Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of...
153
click to vote
ECML
1993
Springer
15 years 10 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
158
click to vote
IPL
2008
15 years 6 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
171
click to vote
AMAI
2005
Springer
15 years 5 months ago
2005
Springer
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
170
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...