610 search results - page 46 / 122 » Using SAT in QBF |
DATE
2002
IEEE
14 years 22 days ago
2002
IEEE
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
CADE
2009
Springer
14 years 8 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...
ISMVL
2009
IEEE
14 years 2 months ago
2009
IEEE
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial MaxSAT instances. First, we obtain new direct and (minimal) support en...
PCM
2004
Springer
14 years 1 months ago
2004
Springer
We propose and describe a novel video capturing system called Sat-Cam that can observe and record the users’ activity from effective viewpoints to negate the effects of unstead...