JBool

swMATH6185MaRDI QIDQ18319FDOQ18319

Author name not available (Why is that?)

Official website: http://orbi.ulg.ac.be/handle/2268/72714

Cited In (only showing first 100 items - show all)

• Counting and enumerating aggregate classifiers
• On the efficiency of normal form systems for representing Boolean functions
• Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
• Linear separation of connected dominating sets in graphs
• Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints
• Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior
• Approximately classic judgement aggregation
• On logical bifurcation diagrams
• Boole-De Morgan bilattices
• Hyperidentities and related concepts. II
• MCP: capturing big data by satisfiability (tool description)
• Hyperidentities and related concepts. I
• Autark assignments of Horn CNFs
• Monotone bargaining is Nash-solvable
• Compact quadratizations for pseudo-Boolean functions
• Computing maximal and minimal trap spaces of Boolean networks
• Representation-compatible power indices
• The power of Sherali-Adams relaxations for general-valued CSPs
• Berge-acyclic multilinear 0-1 optimization problems
• Characterization of zigzag De Morgan functions
• Disjointed sum of products by a novel technique of orthogonalizing ORing
• \(k\)-maxitive Sugeno integrals as aggregation models for ordinal preferences
• A class of valid inequalities for multilinear 0-1 optimization problems
• Testing read-once functions in a median-augmented element basis
• Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
• Oblivious bounds on the probability of boolean functions
• Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
• A logic for binary classifiers and their explanation
• On linear rewriting systems for Boolean logic and some applications to proof theory
• Translating between the representations of a ranked convex geometry
• Matroid optimization problems with monotone monomials in the objective
• Unsupervised learnable neuron model with nonlinear interaction on dendrites
• A three-person deterministic graphical game without Nash equilibria
• Boolean spectral analysis in categorical reservoir modeling
• Critical properties and complexity measures of read-once Boolean functions
• Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
• On existence of ex post Nash consistent representation for effectivity functions
• An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
• Decomposing 1-Sperner hypergraphs
• Lower bounds for Boolean circuits of bounded negation width
• Dirichlet product for Boolean functions
• Linear read-once and related Boolean functions
• The complexity of valued CSPs
• The complexity of AND-decomposition of Boolean functions
• Nondeterminisic sublinear time has measure 0 in P
• On algebraic expressions of directed grid graphs
• caspo
• CoLoMoTo
• Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
• Recursions for modified Walsh transforms of some families of Boolean functions
• Cut approach to invariance groups of lattice-valued functions
• Submodular goal value of Boolean functions
• A representation of antimatroids by Horn rules and its application to educational systems
• Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
• Title not available (Why is that?)
• Super-De Morgan functions and free De Morgan quasilattices
• Locally monotone Boolean and pseudo-Boolean functions
• Quadratization of symmetric pseudo-Boolean functions
• Minimal and locally minimal games and game forms
• On effectivity functions of game forms
• Quadratic reformulations of nonlinear binary optimization problems
• The power of linear programming for general-valued CSPs
• On Boolean threshold functions with minimum specification number
• The give-up problem for blocked regional lists with multi-winners
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• A functional completeness theorem for De Morgan functions.
• The multiple facets of the canonical direct unit implicational basis
• Extended box clustering for classification problems
• Minimal sets on propositional formulae. Problems and reductions
• Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
• Threshold Boolean form for joint probabilistic constraints with random technology matrix
• On Tackling Explanation Redundancy in Decision Trees
• Hardness results for approximate pure Horn CNF formulae minimization
• On the nonlinearity of monotone Boolean functions
• Prominent classes of the most general subsumptive solutions of Boolean equations
• Discrete piecewise linear functions
• De Morgan functions and free De Morgan algebras.
• Attack-defense trees
• The complexity of general-valued CSPs
• 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
• Counting inequivalent monotone Boolean functions.
• Invariance groups of finite functions and orbit equivalence of permutation groups.
• BoolNet
• VBASim
• Fuzzy relational equations with min-biimplication composition
• PANDA
• MOCHA
• RAKAPOSHI
• Ltur
• Leibniz
• PATRICIA
• Logical analysis of data: classification with justification
• MIQCR-CB
• DAGGER
• RRE
• QBFEVAL
• ZRes

This page was built for software: JBool