-
1 conjunctive normal form
тұтастырылған қалыпты түрThe English-Kazakh dictionary of Informatics and computer technology dictionary > conjunctive normal form
См. также в других словарях:
Conjunctive grammar — Conjunctive grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context free grammars, with a conjunction operation. Besides explicit conjunction, conjunctive grammars allow… … Wikipedia
Conjunctive query — In database theory, a conjunctive query is a restricted form of first order queries. A large part of queries issued on relational databases can be written as conjunctive queries, and large parts of other first order queries can be written as… … Wikipedia
Conjunctive normal form — In Boolean logic, a formula is in conjunctive normal form (CNF) if it is a conjunction of clauses, where a clause is a disjunction of literals. As a normal form, it is useful in automated theorem proving. It is similar to the product of sums form … Wikipedia
Conjunctive adverb — A conjunctive adverb is an adverb that connects two clauses. Conjunctive adverbs show cause and effect, sequence, contrast, comparison, or other relationships. Contents 1 Common conjunctive adverbs 2 Punctuation 3 Examples 4 … Wikipedia
conjunctive symbiosis — Symbiosis Sym bi*o sis, n. [NL., fr. Gr. symbi wsis a living together, symbioy^n to live together; sy n with + ? to live.] (Biol.) The living together in more or less imitative association or even close union of two dissimilar organisms. In a… … The Collaborative International Dictionary of English
conjunctive normal form — noun The form of a boolean formula that the formula has if the formula is a conjunction of disjunctions of literals, such as (A or B or C) and (D or E or not F) … Wiktionary
Disjunctive normal form — In boolean logic, a disjunctive normal form (DNF) is a standardization (or normalization) of a logical formula which is a disjunction of conjunctive clauses. As a normal form, it is useful in automated theorem proving. A logical formula is… … Wikipedia
Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… … Wikipedia
Boolean conjunctive query — In the theory of relational databases, a Boolean conjunctive query is a conjunctive query without distinguished predicates, i.e., a query in the form , where each Ri is a relation symbol and each ti is a tuple of variables and constants; the… … Wikipedia
Clausal normal form — The clausal normal form (or clause normal form, conjunctive normal form, CNF) of a logical formula is used in logic programming and many theorem proving systems. A formula in clause normal form is a set of clauses, interpreted as a conjunction. A … Wikipedia
Canonical form — Generally, in mathematics, a canonical form (often called normal form or standard form) of an object is a standard way of presenting that object. Canonical form can also mean a differential form that is defined in a natural (canonical) way; see… … Wikipedia