Searching for "Using SAT in QBF." – sorted by Relevance.
-
Using SAT in QBF
- Using SAT in QBF Horst Samulowitz and Fahiem Bacchus ⋆ Department of Computer Science, University
- Cited by 4 (1 self) – Add To MetaCart
-
Bounded model checking with QBF
- the usage of QBF in BMC, using general-purpose SAT and QBF solvers. We also present a special
- Cited by 8 (1 self) – Add To MetaCart
-
Game-SAT: a Preliminary Report
- they can be reduced to each other in polynomial time. Besides, many methods used in SAT or QBF solvers can
- Cited by 1 (0 self) – Add To MetaCart
-
Type-Aware Web Service Composition Using Boolean Satisfiability Solver
- . To efficiently solve various games, Alur at el. [1] proposed several techniques using SAT and QBF solvers
- Add To MetaCart
-
Symbolic model checking for asynchronous boolean programs
- the dynamic partial-order reduction. Whereas they use BDDs, we use SAT and QBF solvers and must therefore
- Cited by 11 (5 self) – Add To MetaCart

