LAC
/
Questionnaire-2024
3
0
Fork 0
Code Issues Pull Requests Projects Releases 12 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
7 Commits
1 Branch
12 Tags
1.2 MiB
Tree: 5be6e3e72c
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '5be6e3e72c'
${ noResults }
Questionnaire-2024/sat_solvers_dpll/0005_sol.tex

2 lines
303 B
Raw Normal View History

init commit
5 months ago
​
  1. Boolean Constraint Propagation and Pure Literals are so-called heuristics. BCP and PL capture when the choices we can make are restricted in two different ways.
  2. It is advantageous to apply these heuristics before making a decision, since it reduces the amount of different assignments we have to check.