Results 11 to 20 of about 1,765 (205)
Disentangling Neural Disjunctive Normal Form Models
CoRRAccepted at NeSy ...
Kexin Gu Baugh +5 more
core +8 more sources
Disjunctive and conjunctive normal forms of pseudo-Boolean functions
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephan Foldes, Peter L. Hammer
openaire +3 more sources
On the Sensitivity Conjecture for Disjunctive Normal Forms [PDF]
CoRR, 2016 The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures. Despite major advances in the analysis of Boolean functions over the last decade, the problem remains widely open.
C. S. Karthik, Sébastien Tavenas
+9 more sources
On the learnability of disjunctive normal form formulas [PDF]
Machine Learning, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Howard Aizenstein, Leonard Pitt
openalex +5 more sources
An Optimized Transformation into Conjunctive (or Disjunctive) Normal Form [PDF]
, 1987 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.
Socher, Rolf
openaire +2 more sources
Disjunctive Normal Form for Multi-Agent Modal Logics Based on Logical Separability
, 2019 Modal logics are primary formalisms for multi-agent systems but major reasoning tasks in such logics are intractable, which impedes applications of multi-agent modal logics such as automatic planning.
Liangda Fang +3 more
openalex +3 more sources
Approximating Boolean Functions with Disjunctive Normal Form [PDF]
CoRR, 2020 The theorem states that: Every Boolean function can be $ε-approximated$ by a Disjunctive Normal Form (DNF) of size $O_ε(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is generated and proving its correctness.
Yunhao Yang, Andrew Tan
openalex +3 more sources
Disjunctive bases: normal forms and model theory for modal logics [PDF]
Logical Methods in Computer Science, 2022 We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi.
Sebastian Enqvist, Yde Venema
openalex +6 more sources
Finding a short and accurate decision rule in disjunctive normal form by exhaustive search [PDF]
, 2010 Greedy approaches suffer from a restricted search space which could lead to suboptimal classifiers in terms of performance and classifier size. This study discusses exhaustive search as an alternative to greedy search for learning short and accurate ...
Peter R. Rijnbeek, Jan A. Kors
openalex +3 more sources
Probabilistic Disjunctive Normal Forms in Temporal Logic and Automata Theory [PDF]
CoRRThis article introduces probabilistic disjunctive normal forms (PDNFs) as a framework for representing and reasoning about uncertainty in logical systems. Unlike classical DNFs, PDNFs assign real-valued weights to variables, encoding probabilistic information about their presence, absence, or negation.
Alexander Kuznetsov
+5 more sources