normal form
41Kernel Normal Form — Kernel normal form, or KNF, is the normal form used in the development of code for the BSD operating systems. Based on the original KNF concept from the Computer Systems Research Group, it dictates a code style to which contributed code should… …
42Administrative normal form — In computer science, administrative normal form (abbreviated ANF) is a canonical form of programs, which was introduced by Flanagan et al 1993 to serve as an intermediate representation in functional compilers to make subsequent transformations… …
43Jordan normal form — Jordano norminė forma statusas T sritis automatika atitikmenys: angl. Jordan canonical form; Jordan normal form vok. Jordansche Normalform, f; Kanonische Jordanform, f rus. жорданова нормальная форма, f; каноническая форма Жордана, f pranc. forme …
44Negational normal form — Negative normal form is way to represent the formula by keeping the negation symbol only to the literals. If α and φ are boolean formulas, then α φ , α φ, α, α φ are all boolean formulas. The boolean formulas are made up of literals which are… …
45prenex normal form — A well formed formula of the predicate calculus is in prenex normal form if all the quantifiers stand at the front, and any other logical constant stands within the scope of all the quantifiers …
46Fourth Normal Form — [engl.], in einer relationalen Datenbank die vierte Normalform …
47disjunctive 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 …
48prenex normal form — ˈprēˌneks noun Etymology: Late Latin praenexus tied up or bound in front, from Latin prae pre + nexus, past participle of nectere to tie, bind more at annex : a normal form of an expression in the functional calculus in which all the quantifiers… …
49conjunctive 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) …
50disjunctive 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) …
