Clause (logic)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In logic, a clause is a propositional formula formed from a finite collection of literals (atoms or their negations) and logical connectives. A clause is true either whenever at least one of the literals that form it is true (a disjunctive clause, the most common use of the term), or when all of the literals that form it are true (a conjunctive clause, a less common use of the term). That is, it is a finite disjunction or conjunction of literals, depending on the context. Clauses are usually written as follows, where the symbols l_i are literals: : l_1 \vee \cdots \vee l_n

In logic, a clause is a propositional formula formed from a finite collection of literals (atoms or their negations) and logical connectives. A clause is true either whenever at least one of the literals that form it is true (a disjunctive clause, the most common use of the term), or when all of the literals that form it are true (a conjunctive clause, a less common use of the term). That is, it is a finite disjunction or conjunction of literals, depending on the context. Clauses are usually written as follows, where the symbols l_i are literals: l_1 \vee \cdots \vee l_n

Empty clauses

A clause can be empty (defined from an empty set of literals). The empty clause is denoted by various symbols such as \empty , \bot , or \Box . The truth evaluation of an empty disjunctive clause is always false. This is justified by considering that false is the neutral element of the monoid (\{\mathrm{false}, \mathrm{true}\}, \vee) . The truth evaluation of an empty conjunctive clause is always true. This is related to the concept of a vacuous truth.

Implicative form

Every nonempty (disjunctive) clause is logically equivalent to an implication of a head from a body, where the head is an arbitrary literal of the clause and the body is the conjunction of the complements of the other literals. That is, if a truth assignment causes a clause to be true, and all of the literals of the body satisfy the clause, then the head must also be true. This equivalence is commonly used in logic programming, where clauses are usually written as an implication in this form. More generally, the head may be a disjunction of literals. If b_1, \ldots, b_m are the literals in the body of a clause and h_1, \ldots, h_n are those of its head, the clause is usually written as follows: h_1, \ldots, h_n \leftarrow b_1, \ldots, b_m. If n = 1 and m = 0, the clause is called a (Prolog) fact If n = 1 and m > 0, the clause is called a (Prolog) rule If n = 0 and m > 0, the clause is called a (Prolog) query If n > 1, the clause is no longer Horn

See also

Conjunctive normal form Disjunctive normal form

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1369526364 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.