470 search results - page 81 / 94 » Tabu Search for SAT |
101
click to vote
DAC
2001
ACM
16 years 1 months ago
2001
ACM
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
74
Voted
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
189
click to vote
FROCOS
2011
Springer
14 years 9 days ago
2011
Springer
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
120
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
91
Voted
GLVLSI
2003
IEEE
15 years 6 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...