Where does clause collide?

In grammar, a clause is the basic unit of syntax organised around a predicate, usually a verb together with the participants and circumstances that go with it: a main (independent) clause can stand alone as a sentence, while a subordinate (dependent) clause is embedded within or attached to another. Halliday and Matthiessen's Halliday's Introduction to Functional Grammar (2014) treats the clause as the central unit through which a language builds meaning, working at once as a message, as an exchange between speakers, and as a representation of some event. Here the referent is a structural unit of language defined by its predicate, not a numbered provision in a legal document or a row of symbols in a logical formula.[1]

Unit

One grammatical clause: a predicate with its associated elements, classed as main or subordinate

Recovery means

Not applicable

Measured by

Identified by parsing a sentence into predicates and their dependents, then labelled by clause type and function

In formal logic and computer science, a clause is a disjunction of literals, that is, a set of atomic statements and their negations joined by 'or', used as the building block of a formula in conjunctive normal form, in which the whole formula is a conjunction ('and') of such clauses. Davis and Putnam's A Computing Procedure for Quantification Theory (1960) made the clause the object on which automated satisfiability procedures operate, and the special case of a Horn clause, with at most one positive literal, defined by Horn (1951), underlies logic programming and the language Prolog. The referent is an item in a symbolic formula manipulated by an algorithm, not a unit of natural-language grammar and not a provision of a legal document.[2][3]

Unit

One disjunction of literals: a clause in a conjunctive normal form formula

Recovery means

Not applicable

Measured by

Handled by a solver as a set of literals, tested for satisfiability and simplified by resolution or unit propagation