100 search results - page 6 / 20 » Solving the minimum-cost satisfiability problem using SAT ba... |
104
Voted
ICTAI
1997
IEEE
15 years 4 months ago
1997
IEEE
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
103
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
111
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
116
Voted
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
102
Voted
ENTCS
2006
15 years 21 days ago
2006
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...