A disjunction of literals (atoms or their negations) treated as a single syntactic unit, commonly used in conjunctive normal form (CNF) and as the basic object for resolution-based proof procedures and SAT solving.

Principle

A clause encodes a constraint that at least one of its literals must be true; representing formulas as sets of clauses (CNF) permits uniform application of resolution and unit propagation operations.

Demonstration

Consider the clause (¬P ∨ Q ∨ R) and the unit clause (P). Resolving them yields the resolvent (Q ∨ R). In a resolution refutation, repeated resolution steps on clauses can derive the empty clause, indicating unsatisfiability.

Misapplication

Treating a clause as equivalent to an implication in contexts where variable scoping or quantifiers matter (first-order logic) without renaming, or using resolution blindly on non-CNF formulas without proper normalization, which can lead to incorrect outcomes.

Consequence

Viewing knowledge as a set of clauses enables efficient algorithmic techniques (unit propagation, watched literals, DPLL/CDCL for SAT and resolution-based theorem proving) and modular representation of propositional constraints.

Reversal

The dual viewpoint is a conjunction of literals (a cube) or treating full formulas instead of normalized clauses; moving back to arbitrary formula structure can restore readability but loses the uniformity exploited by resolution algorithms.

Boundary

A clause is a specific syntactic form (finite disjunction of literals); it applies in propositional and first-order contexts (with variables and implicit quantifiers) after suitable normalization and renaming, and excludes arbitrary nested Boolean structure unless normalized.

Semantic Tension

Tension exists between the compact, algorithm-friendly clause representation and formula-level representations that preserve syntactic structure and meaning more directly; clauses favor computation, while formulas favor human interpretability.

Synthesis

A clause is a normalized syntactic unit— a finite disjunction of literals—used to express constraints in CNF that are particularly amenable to resolution and SAT algorithms, trading some syntactic richness for algorithmic uniformity.