The following pages link to (Q3634956):
Displaying 15 items.
- Solving satisfiability problems with preferences (Q606909) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- A new 3-CNF transformation by parallel-serial graphs (Q976123) (← links)
- Some interesting research directions in satisfiability (Q1601833) (← links)
- A novel SAT solver for the van der Waerden numbers (Q2338161) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- A Solution of Horn-SAT with P Systems Using Antimatter (Q2789137) (← links)
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition (Q2898000) (← links)
- An approximative inference method for solving ∃∀SO satisfiability problems (Q3143568) (← links)
- (Q3506044) (← links)
- SAT graph-based representation: A new perspective (Q3527692) (← links)
- (Q3985723) (← links)
- Solving the incremental satisfiability problem (Q4036286) (← links)
- A new approach to partial constraint satisfaction problems (Q4652852) (← links)
- (Q5687270) (← links)