Results 171 to 180 of about 1,765 (205)

Disjunctive normal forms and local exceptions

ACM SIGPLAN Notices, 2003
All classical ?-terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a specialized sequent calculus and shown to be correct.
Beffara, Emmanuel, Danos, Vincent
openaire   +2 more sources

Symbolic minimization of disjunctive normal forms

Computational Mathematics and Modeling, 1993
M. V. Mikhailyuk, N. G. Sedrakyan
exaly   +2 more sources

Ordered model trees: A normal form for disjunctive deductive databases

Journal of Automated Reasoning, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adnan Yahya, Jack Minker, Minker Jack
exaly   +3 more sources

Probabilistic induction of decision trees and disjunctive normal forms

Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), 2002
The authors develop a theory for general decision tree induction based on both the logical structure of concepts and the probability distribution of examples. The discrete function is the common analytic representation of decision trees and decision tables (rules). One of the most important classes of discrete functions is the disjunctive normal forms (
Xiao-Jia M. Zhou, Tharam S. Dillon
openaire   +1 more source

An Algorithm for Weak Disjunctive Normal Form Reduction in G3 Logic

2008 International Conference on Computer Science and Software Engineering, 2008
In this paper, we put forward a weak conjunctive normal form for G3, which is similar to the conjunctive normal form for classical propositional logic. We also give two algorithms to reduce a formula to weak conjunctive normal form, where one is based on charactering countermodels in model-based-formulas, and the other is based on rewriting formulas ...
Xianchun Zou
exaly   +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.
Alexander Kogan
openalex   +4 more sources

Construction of Minimal Disjunctive Normal Forms

1969
In this paper we present an algorithm for finding one of the minimal disjunctive normal forms (DNF) for an incompletely specified function of the algebra of logic. A completely specified function can be considered as a special case of an incompletely specified function.
N. A. Gorbovitskaya, I. Sh. Pinsker
openaire   +1 more source

On the complexity of the disjunctive normal form of threshold functions

Discrete Mathematics and Applications, 2000
Summary: We consider the problem of estimating the complexity of the disjunctive normal form (dnf) of threshold functions in \(n\) variables, where the complexity is the minimal number of simple implicants in the representation of the dnf. It is known that the complexity of the dnf of almost all threshold functions is no less than \(n^2/\log_2n\).
exaly   +3 more sources

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

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