Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
From MaRDI portal
(Redirected from Towards an Optimal CNF Encoding of Boolean Cardinality Constraints)
Recommendations
Cited in
(only showing first 100 items - show all)- maxSAT-based large neighborhood search for high school timetabling
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Modeling and solving staff scheduling with partial weighted maxSAT
- Intra- and interdiagram consistency checking of behavioral multiview models
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Encoding cardinality constraints using multiway merge selection networks
- Optimal symmetry breaking for graph problems
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- Generating extended resolution proofs with a BDD-based SAT solver
- Propagation complete encodings of smooth DNNF theories
- Multi-agent path finding with mutex propagation
- A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis
- Coupling different integer encodings for SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Propositional proof systems based on maximum satisfiability
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Computing properties of stable configurations of thermodynamic binding networks
- Backdoors to tractable answer set programming
- meSAT: multiple encodings of CSP to SAT
- Iterative and core-guided maxsat solving: a survey and assessment
- On an MCS-based inconsistency measure
- Parameterized complexity classes beyond para-NP
- Algorithms for computing minimal unsatisfiable subsets of constraints
- On the query complexity of selecting minimal sets for monotone predicates
- Delegatable functional signatures
- Automatic search of linear trails in ARX with applications to SPECK and Chaskey
- Perfect hashing and CNF encodings of cardinality constraints
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- Formal analysis of the entropy / security trade-off in first-order masking countermeasures against side-channel attacks
- Propositional SAT solving
- A fast symbolic transformation based algorithm for reversible logic synthesis
- Detecting cardinality constraints in CNF
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- GAC Via Unit Propagation
- Towards Robust CNF Encodings of Cardinality Constraints
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
- Encoding Treewidth into SAT
- Sequential Encodings from Max-CSP into Partial Max-SAT
- Cardinality Networks and Their Applications
- New Encodings of Pseudo-Boolean Constraints into CNF
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Boolean satisfiability in quantum compilation
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- MiFuMax -- a literate MaxSAT solver. System description
- Hard satisfiable 3-SAT instances via autocorrelation
- Learning Optimal Decision Sets and Lists with SAT
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Mining top-\(k\) motifs with a SAT-based framework
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Bounds on the size of PC and URC formulas
- Finding the hardest formulas for resolution
- Learning discrete decomposable graphical models via constraint optimization
- Efficient SAT-based encodings of conditional cardinality constraints
- Implementing efficient All solutions SAT solvers
- Cardinality networks: a theoretical and empirical study
- A parametric approach for smaller and better encodings of cardinality constraints
- Efficient CNF encoding of Boolean cardinality constraints
- Three-dimensional stable matching with cyclic preferences
- SAT-based optimal classification trees for non-binary data
- New method for combining Matsui's bounding conditions with sequential encoding method
- Computing optimal hypertree decompositions with SAT
- Generating Extended Resolution Proofs with a BDD-Based SAT Solver
- State identification and verification with satisfaction
- Interactive portfolio selection involving multicriteria sorting models
- Differential cryptanalysis of round-reduced \texttt{SPEEDY} family
- Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3
- Convexity of division property transitions: theory, algorithms and compact models
- A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Drawing Order Diagrams Through Two-Dimension Extension
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
- Clausal proofs for pseudo-Boolean reasoning
- Conflict-free electric vehicle routing problem: an improved compositional algorithm
- Planning with partial observability by SAT
- Distinguisher and related-key attack on HALFLOOP-96
- Improved attacks on \texttt{GIFT-64}
- Improved the automated evaluation algorithm against differential attacks and its application to WARP
- Parallel SAT framework to find clustering of differential characteristics and its applications
- CNF encodings of symmetric functions
- Automated-based rebound attacks on ACE permutation
- Automated symmetric constructions in discrete geometry
- Finding connections via satisfiability solving
- ESLIM: Circuit minimization with SAT based local improvement
- SAT encoding of partial ordering models for graph coloring problems
- Exploring the optimal differential characteristics of SM4. Improving automatic search by including human insights
- Computing and certifying twin-width using logic
- Improved bounds on the domatic numbers of queens graphs
- AxSAT -- bringing axioms to SAT planning
- A new automatic framework for searching rotational-XOR differential characteristics in ARX ciphers
- Computing NP-hard repetitiveness measures via MAX-SAT
- Mutual-visibility and general position sets in Sierpiński triangle graphs
- Variety of mutual-visibility problems in hypercubes
- Comparison of SAT-based and ASP-based algorithms for inconsistency measurement
- Declarative approaches to outcome determination in judgment aggregation
- North-east lattice paths avoiding k collinear points via satisfiability
- Structure-guided automated reasoning
- A nonexistence certificate for projective planes of order ten with weight 15 codewords
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models
This page was built for publication: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524229)
