Cited in
(only showing first 100 items - show all)- Counting and enumerating aggregate classifiers
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Super-De Morgan functions and free De Morgan quasilattices
- Locally monotone Boolean and pseudo-Boolean functions
- Quadratization of symmetric pseudo-Boolean functions
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- An iterative method for linear decomposition of index generating functions
- On the efficiency of normal form systems for representing Boolean functions
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- pystablemotifs
- Implementing efficient All solutions SAT solvers
- Minimal and locally minimal games and game forms
- On effectivity functions of game forms
- Quadratic reformulations of nonlinear binary optimization problems
- Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints
- Linear separation of connected dominating sets in graphs
- Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior
- On logical bifurcation diagrams
- Approximately classic judgement aggregation
- MCP: capturing big data by satisfiability (tool description)
- On Boolean threshold functions with minimum specification number
- Boole-De Morgan bilattices
- Hyperidentities and related concepts. II
- The power of linear programming for general-valued CSPs
- The give-up problem for blocked regional lists with multi-winners
- Hyperidentities and related concepts. I
- Autark assignments of Horn CNFs
- Acyclic, or totally tight, two-person game forms: characterization and main properties
- A functional completeness theorem for De Morgan functions.
- Representing fitness landscapes by valued constraints to understand the complexity of local search
- New width parameters for SAT and \#SAT
- The multiple facets of the canonical direct unit implicational basis
- Monotone bargaining is Nash-solvable
- On the Readability of Monotone Boolean Formulae
- Extended box clustering for classification problems
- Compact quadratizations for pseudo-Boolean functions
- Minimal sets on propositional formulae. Problems and reductions
- Computing maximal and minimal trap spaces of Boolean networks
- Representation-compatible power indices
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Berge-acyclic multilinear 0-1 optimization problems
- The power of Sherali-Adams relaxations for general-valued CSPs
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- Characterization of zigzag De Morgan functions
- Disjointed sum of products by a novel technique of orthogonalizing ORing
- On Tackling Explanation Redundancy in Decision Trees
- k-maxitive Sugeno integrals as aggregation models for ordinal preferences
- A combinatorial approach for small and strong formulations of disjunctive constraints
- A class of valid inequalities for multilinear 0-1 optimization problems
- Prominent classes of the most general subsumptive solutions of Boolean equations
- On the nonlinearity of monotone Boolean functions
- Hardness results for approximate pure Horn CNF formulae minimization
- Testing read-once functions in a median-augmented element basis
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- Discrete piecewise linear functions
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
- Oblivious bounds on the probability of boolean functions
- Translating between the representations of a ranked convex geometry
- Boolean functions with long prime implicants
- De Morgan functions and free De Morgan algebras.
- A logic for binary classifiers and their explanation
- On linear rewriting systems for Boolean logic and some applications to proof theory
- Matroid optimization problems with monotone monomials in the objective
- FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS
- Unsupervised learnable neuron model with nonlinear interaction on dendrites
- Attack-defense trees
- A three-person deterministic graphical game without Nash equilibria
- BoolNet
- VBASim
- PANDA
- MOCHA
- RAKAPOSHI
- Ltur
- Leibniz
- PATRICIA
- MIQCR-CB
- DAGGER
- RRE
- QBFEVAL
- ZRes
- BBCPOP
- POLIP
- MaBoSS
- qbsolv
- BioLQM
- DSGRN
- cl-jointgen
- FK-B
- FluxModeCalculator
- Generalising unit-refutation completeness and SLUR via nested input resolution
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
- A new time-independent reliability importance measure
- Totally optimal decision trees for Boolean functions
- ITI
- MediBoost
- The complexity of general-valued CSPs
- Approximating minimum representations of key Horn functions
- Boolean spectral analysis in categorical reservoir modeling
- Critical properties and complexity measures of read-once Boolean functions
- Counting inequivalent monotone Boolean functions.
This page was built for software: JBool
