Alice/my_digital_garden
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

fixing issues lol

Browse source
This commit is contained in:
Alice 2023-09-19 21:17:35 +01:00
parent f167d64c47
commit ac86a3161a
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
content/MFES/T - Aula 2 - 18 Setembro 2023.md
View file

@ -27,8 +27,8 @@ Usually SAT solvers deal with formulas in conjunctive normal form (CNF)
- **clause**: disjuntion of literals. (A _ ¬B _ C) - **clause**: disjuntion of literals. (A _ ¬B _ C)
- **conjunctive normal form**: conjuction of clauses. (A _ ¬B _ C) ^ (B _ ¬A) ^ ¬C - **conjunctive normal form**: conjuction of clauses. (A _ ¬B _ C) ^ (B _ ¬A) ^ ¬C
> [!info]+ Cook's theorem(1971) > [!info]+ Cook's theorem(1971)
> SAT is NP-complete > SAT is NP-complete
## 1.2 Proposicional Logic (PL) ## 1.2 Proposicional Logic (PL)