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