Results 61 to 70 of about 1,765 (205)

Minimal disjunctive normal form

, 2013
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all rows that return True. The prime implicants for these cases consolidate rules by introducing so-called "don't care" inputs that specify cases that do not
Schreiber, Michael
core  

A Conformant Planner with Explicit Disjunctive Representation of Belief States

, 2009
This paper describes a novel and competitive complete conformant planner. Key to the enhanced performance is an efficient encoding of belief states as disjunctive normal form formulae and an efficient procedure for computing the successor belief state ...
To, Son, Pontelli, Enrico, Son, Tran
core   +1 more source

Logical optimization of Boolean nets using Shannon expansion

Informatika, 2019
A synthesis of logical circuits, comprising functional combination blocks of very large scale integration circuits, is one of the most important tasks of computer-aided design.
P. N. Bibilo, Yu. Y. Lankevich
doaj  

GENOTYPE PHENOTYPE MAPPING IN RNA VIRUSES - DISJUNCTIVE NORMAL FORM LEARNING [PDF]

, 2010
RNA virus phenotypic changes often result from multiple alternative molecular mechanisms, where each mechanism involves changes to a small number of key residues. Accordingly, we propose to learn genotype-phenotype functions, using Disjunctive Normal Form (DNF) as the assumed functional form.
Chuang Wu, Andrew S. Walsh, Roni Rosenfeld   +2 more
openaire   +2 more sources

MINIMIZING THE MULTILEVEL REPRESENTATIONS OF SYSTEMS OF BOOLEAN FUNCTIONS BASED ON SHANNON DECOMPOSITION

Informatika, 2017
A locally optimal algorithm is proposed to form a permutation of variables, which are used to obtain successive Shannon decompositions of a system of disjunctive normal forms of completely specified Boolean functions.
P. N. Bibilo, Y. Y. Lankevich
doaj  

A normal form for Euler diagrams with shading

, 2008
In logic, there are various normal forms for formulae; for example, disjunctive and conjunctive normal form for formulae of propositional logic or prenex normal form for formulae of predicate logic.
John, Chris, Fish, Andrew; id_orcid, Taylor, John   +2 more
core   +1 more source

Logical optimization the multilevel representations of systems of Boolean functions based on partitioning into blocksand Shannon decomposition

Informatika, 2018
The results of experimental study of the effectiveness of optimization procedures for systems of Boolean functions which are used in the synthesis of combinational circuits are described.
P. N. Bibilo, N. A. Kirienko, Y. Y. Lankevich   +2 more
doaj  

NP-Completeness of mine planning under logical environmental constraints

Applied Computing and Geosciences
Environmental constraints in mine planning exhibit logical interdependence that linear inequalities cannot capture. This paper formalizes the Environmentally Constrained Mine Planning Problem (ECMPP) with environmental conditions as Boolean predicates in
Raymond Kudzawu-D’Pherdd, Johnson Nuviadenu, Devan Neil, Elynam Kudzawu-D’Pherdd, Johanna H. Linus, Emmanuel Romaric Ouabo   +5 more
doaj   +1 more source

Finite-state concurrent programs can be expressed succinctly in triple normal form [PDF]

, 2017
I show that any finite-state shared-memory concurrent program P can be transformed into triple normal form: all variables are shared between exactly three processes, and the guards on actions are conjunctions of conditions over this triple-shared state ...
Paul C. Attie, Attie, Paul C.
core   +1 more source

Disjunctive programming: Properties of the convex hull of feasible points

, 1998
In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes pure and mixed integer programs and many other nonconvex programming problems.
Balas, Egon
core   +1 more source