Results 221 to 230 of about 1,250 (247)

A Partially Solved Form for Heterogeneous Constraints in Disjunctive Normal Form

2002
In order to support constraint solving for challenging engineering applications, as e.g. accomplished by the Relational Constraint Solver (see [MST]), we need to implement join and project operators (see e.g. [AHV] or [M]) for heterogeneous constraints.
openaire   +1 more source

Privacy-preserving disjunctive normal form operations on distributed sets

Information Sciences, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ji Young Chun, Dowon Hong, Ik Rae Jeong, Dong Hoon Lee 0001   +3 more
openaire   +1 more source

Detection of Disjunctive Normal Form Predicate in Distributed Systems

2007
Predicate detection in a distributed system is an important problem. It is useful in debugging and testing of the distributed system. Two modalities are introduced for predicate detection by Cooper and Marzullo. They are denoted by Possibly and Definitely.
openaire   +1 more source

Boolean function minimization in the class of disjunctive normal forms

Journal of Soviet Mathematics, 1989
See the review in Zbl 0666.06010.
Sapozhenko, A. A., Chukhrov, I. P.
openaire   +2 more sources

Disjunctive normal forms of Boolean functions with a small number of zeros

USSR Computational Mathematics and Mathematical Physics, 1987
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Minimizing disjunctive normal forms of pure first-order logic

Logic Journal of the IGPL, 2017
In contrast to Hintikka’s enormously complex distributive normal forms of first-order logic, this article shows how to generate minimized disjunctive normal forms of first-order logic. An effective algorithm for this purpose is outlined, and the benefits of using minimized disjunctive normal forms to explain the truth conditions of propositions ...
openaire   +1 more source

Moving Between Conjunctive and Disjunctive Normal Forms

2018
As discussed in Chap. 1 (on inequality systems with logical connectives), disjunctive sets have many equivalent forms, of which the two extremes are the conjunctive normal form (CNF) and the disjunctive normal form (DNF). Although these two normal forms are at the opposite ends of the variety of equivalent forms, they share a property not common to all
openaire   +1 more source

Verification of PLTL formulae by means of monotone disjunctive normal forms

1997
This paper offers a satisfiability checking algorithm for the future fragment of Propositional Linear Temporal Logic. The algorithm combines the automata theoretic approach to the verification of temporal formulae and the symbolic computation technique in terms of monotone boolean disjunctive normal forms. The algorithm is given as follows.
openaire   +1 more source

Irredundant disjunctive normal forms of random Boolean functions

J. Inf. Process. Cybern., 1983
Summary: Estimates for the number of irredundant DNF of random Boolean functions are given. In this paper, a method of \textit{A. A. Sapozhenko} [Mat. Zametki 4, 649-658 (1968; Zbl 0169.017)] is generalized and simplified by using another probabilistic model.
openaire   +1 more source

Minimization of disjunctive normal forms of fuzzy logic functions

Journal of the Franklin Institute, 1981
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources