JBool

swMATH6185MaRDI QIDQ18319FDOQ18319

Author name not available (Why is that?)

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

• The Power of Sherali--Adams Relaxations for General-Valued CSPs
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
• 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
• On logical bifurcation diagrams
• MCP: capturing big data by satisfiability (tool description)
• Autark assignments of Horn CNFs
• Computing Shapley Effects for Sensitivity Analysis
• New width parameters for SAT and \#SAT
• The Complexity of Valued CSPs
• Compact quadratizations for pseudo-Boolean functions
• Representation-compatible power indices
• 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
• 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 lower bound on CNF encodings of the at-most-one constraint
• Boolean functions with long prime implicants
• A logic for binary classifiers and their explanation
• Translating between the representations of a ranked convex geometry
• Matroid optimization problems with monotone monomials in the objective
• 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 lengths of edge-labeled graph expressions
• An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
• Decomposing 1-Sperner hypergraphs
• Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
• Estimation of expressions' complexities for two-terminal directed acyclic graphs
• Joint realizability of monotone Boolean functions
• Dirichlet product for Boolean functions
• Linear read-once and related Boolean functions
• The complexity of AND-decomposition of Boolean functions
• Implementing Efficient All Solutions SAT Solvers
• On algebraic expressions of directed grid graphs
• Title not available (Why is that?)
• Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
• Title not available (Why is that?)
• 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
• An iterative method for linear decomposition of index generating functions
• Approximating Minimum Representations of Key Horn Functions
• Notes on Hazard-Free Circuits
• On the Readability of Monotone Boolean Formulae
• Title not available (Why is that?)
• FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS
• Classification of combined action of binary factors and Coxeter groups
• Boolean function metrics can assist modelers to check and choose logical rules
• Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
• Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
• On algebraic immunity of trace inverse functions on finite fields of characteristic two
• Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search
• Counting and enumerating aggregate classifiers
• On Davis-Putnam reductions for minimally unsatisfiable clause-sets
• Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
• A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks
• Title not available (Why is that?)
• Super-De Morgan functions and free De Morgan quasilattices
• Community Structure Inspired Algorithms for SAT and #SAT
• 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 Complexity of General-Valued CSPs
• Approximately classic judgement aggregation
• 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.
• Monotone bargaining is Nash-solvable
• 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
• Computing maximal and minimal trap spaces of Boolean networks
• Approximating Boolean Functions with Depth-2 Circuits
• 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
• Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks
• Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
• Discrete piecewise linear functions
• On linear rewriting systems for Boolean logic and some applications to proof theory
• De Morgan functions and free De Morgan algebras.
• Attack-defense trees
• Generalising unit-refutation completeness and SLUR via nested input resolution
• Unsupervised learnable neuron model with nonlinear interaction on dendrites

This page was built for software: JBool