Results 231 to 240 of about 1,250 (247)

Using Disjunctive Diagrams for Preprocessing of Conjunctive Normal Forms

2022 45th Jubilee International Convention on Information, Communication and Electronic Technology (MIPRO), 2022
openaire   +1 more source

An Optimized Transformation into Conjunctive (or Disjunctive) Normal Form

Resolution based theorem proving systems require the conversion of predicate logic formulae into clausal normal form. One step of all procedures performing this transformation is the multiplication into conjunctive normal form. In general this is a critical step, since it can result in an exponential increase in the size of the original formula.
openaire   +1 more source

On the greatest length of a dead-end disjunctive normal form for almost all Boolean functions

Mathematical Notes, 1968
Sapozhenko A A
exaly  

Disjunctive Normal Form

2012
openaire   +1 more source

A Procedure for Calculating Logic Programs by Replacement of Formulae and Transformation to Disjunctive Normal Form.

Transactions of the Japanese Society for Artificial Intelligence, 2003
Taisuke Sato
exaly  

Linearized disjunctive normal forms of boolean functions

1987
openaire   +1 more source

Estimation of the length and the number of dead-end disjunctive normal forms for almost all partial boolean functions

Mathematical Notes, 1980
Sapozhenko A A
exaly  

Disjunctive Normal Shape and Appearance Priors with Applications to Image Segmentation

Lecture Notes in Computer Science, 2015
Tolga Tasdizen, Fitsum Mesadi, Mujdat Cetin   +2 more
exaly  

Given the Principal Disjunctive Normal Form of Simple Proposition Formula

Advanced Materials Research, 2014
exaly  

The reduction generated algorithm of minimal disjunctive normal form based on discernibility matrix

2012
exaly