- disjunctive normal form
- лог. дизъюнктивная нормальная форма, ДНФ
Большой англо-русский и русско-английский словарь. 2001.
disjunctive normal form
Смотреть что такое "disjunctive normal form" в других словарях:
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
disjunctive normal form — norminė disjunkcinė forma statusas T sritis automatika atitikmenys: angl. disjunctive normal form; DNF vok. disjungtive Normalform, f rus. дизъюнктивная нормальная форма, f pranc. forme disjonctive normale, f … Automatikos terminų žodynas
disjunctive normal form — noun The form of a boolean formula that the formula has if the formula is a disjunction of conjunctions of literals, such as (A and B and C) or (D and E and not F) … Wiktionary
normal form — A well formed formula of the propositional calculus is in conjunctive normal form when it is of the form A & B &…where each of A, B…is a formula consisting of a disjunction of atomic propositions or negations of atomic propositions (e.g. p ∨q ∨ ¬ … Philosophy dictionary
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
Negation normal form — A logical formula is in negation normal form if negation occurs only immediately above elementary propositions, and { } are the only allowed Boolean connectives. In classical logic each formula can be brought into this form by replacing… … Wikipedia
Algebraic normal form — In Boolean logic, the algebraic normal form (ANF) is a method of standardizing and normalizing logical formulas. As a normal form, it can be used in automated theorem proving (ATP), but is more commonly used in the design of cryptographic random… … 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
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
Normal number — For the floating point meaning in computing, see normal number (computing). In mathematics, a normal number is a real number whose infinite sequence of digits in every base b[1] is distributed uniformly in the sense that each of the b digit… … Wikipedia
Disjunctive sum — The disjunctive sum of two games is a game in which the two games are played in parallel, with each player being allowed to move in just one of the games per turn. This is extended to disjunctive sums of any number of games by associativity,… … Wikipedia
