|
This video introduces the key idea behind the DLPP algorithm. If we decide to make some literal true, we may reduce the problem to a simpler problem. We will build our DPLL algorithm by using this…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We derive the implication rule using the rules introduced last week.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We use the rules to reduce a sequent to a conjunction of simple
sequents, sequents that only mentions propositional letters, with no
connectives, and no repetitions — in this example, we find…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We can now give Gentzen's rules for ¬ ⋀ ⋁.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|