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

vault backup: 2023-09-26 15:32:01

Browse source
This commit is contained in:
Alice 2023-09-26 15:32:01 +01:00
parent b4bbe1ae12
commit 66ce1bb648
10 changed files with 150 additions and 106 deletions
Download patch file Download diff file Expand all files Collapse all files

10
4a1s/MFES/PL - Aula 1.md
View file

@ -1,7 +1,7 @@
---
dg-publish: true
---
🌫 18 Setembro 2023 - #MFES
🌫 18 Setembro 2023 - #MFES
## Ficha 1
@ -90,5 +90,9 @@ dg-publish: true
>
> Escreve um conjunto de fórumlas proposicionais adequado à modelação destas regras.
>
> >[!tip]- Resolução
> > [[Ficha1_ex2.excalidraw]]
> >[!tip]- Resolução (por passos)
> >**Cada pessoa ocupa só um único gabinete.**
> > 1. para cada pessoa p = 1..4
> > 2. pelo menos um gabinete: $x_{p1} \lor x_{p2} \lor x_{p3}$
> > 3. no máximo 1 gabinete: $x_{p1} \implies \neg x_{p2} \land x_{p3} \equiv x_{p1} \implies \neg (x_{p2} \lor x_{p3} ) \equiv x_{p2} \implies \neg x_{p3}$
> > 4.

2
4a1s/MFES/T - Aula 2.md
View file

@ -123,4 +123,4 @@ A formula $F$ is:
## 2.1 DPLL Framework
The idea is to **incrementally construct an assignment compatible with a CNF**, propagating the implications of the decisions made that are easy to detect and simplifying the clauses.
A CNF is satisfied by an assignment if all its clauses are satisfied. And a clause is satisfied if at least one of its literals is satisfied.
A CNF is satisfied by an assignment if all its clauses are satisfied. And a clause is satisfied if at least one of its literals is satisfied.