Sciweavers

142 search results - page 20 / 29
» On-the-Fly Clause Improvement
Sort
View
157
Voted
AI
2005
Springer
15 years 1 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
139
Voted
DAM
1999
100views more  DAM 1999»
15 years 1 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
104
Voted
DAC
2006
ACM
16 years 2 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
118
Voted
ICML
2006
IEEE
16 years 2 months ago
A statistical approach to rule learning
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
Stefan Kramer, Ulrich Rückert
VLSID
2009
IEEE
115views VLSI» more  VLSID 2009»
16 years 2 months ago
Efficient Techniques for Directed Test Generation Using Incremental Satisfiability
Functional validation is a major bottleneck in the current SOC design methodology. While specification-based validation techniques have proposed several promising ideas, the time ...
Prabhat Mishra, Mingsong Chen