50 search results - page 8 / 10 » On Solving MaxSAT Through SAT |
147
click to vote
ICCAD
2002
IEEE
15 years 10 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
162
click to vote
DLOG
2011
14 years 5 months ago
2011
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...
100
Voted
GRID
2010
Springer
14 years 11 months ago
2010
Springer
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
133
click to vote
ICCAD
2007
IEEE
15 years 10 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...
126
Voted
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...