ConceptTheory & Algos
Contradictory paths
A condition in an implication graph where a literal and its negation can both reach each other, implying the formula is unsatisfiable.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.