The following pages link to (Q4431379):
Displaying 14 items.
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- On threshold BDDs and the optimal variable ordering problem (Q1016038) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Exploiting partial variable assignment in interpolation-based model checking (Q2009611) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- GridSAT: Design and implementation of a computational grid application (Q2505055) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- Hard random 3-SAT problems and the Davis-Putnam procedure (Q2674184) (← links)
- Critical behavior in the computational cost of satisfiability testing (Q2674189) (← links)
- The design of the CADE-13 ATP system competition (Q4647509) (← links)
- Building decision procedures for modal logics from propositional decision procedures — The case study of modal K (Q4647549) (← links)
- Exploiting data dependencies in many-valued logics (Q4868234) (← links)
- A new method for testing decision procedures in modal logics (Q5234709) (← links)
