PySAT: a Python toolkit for prototyping with SAT oracles
From MaRDI portal
Recommendations
Cited in
(35)- RC2: an efficient MaxSAT solver
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Certified DQBF solving by definition extraction
- OptiLog: a framework for SAT-based systems
- Automatic search of linear structure: applications to \textsc{Keccak} and \textsc{Ascon}
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Joint learning of reward machines and policies in environments with partially known semantics
- Search of fractal space-filling curves with minimal dilation
- Learning Optimal Decision Sets and Lists with SAT
- Using a SAT Solver to Find Interesting Sets of Nonstandard Dice
- Optimized SAT encoding of conformance checking artefacts
- Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy
- On Tackling Explanation Redundancy in Decision Trees
- Cover combinatorial filters and their minimization problem
- Explaining Hyperproperty Violations
- Witnesses for Answer Sets of Logic Programs
- PySAT
- Hashing-based approximate counting of minimal unsatisfiable subsets
- CNF encodings of symmetric functions
- A SAT encoding to compute aperiodic tiling rhythmic canons
- Coupling different integer encodings for SAT
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Efficiently explaining CSPs with unsatisfiable subset optimization
- SAT-based rigorous explanations for decision lists
- Evaluating ESOP Optimization Methods in Quantum Compilation Flows
- Learning MAX-SAT from contextual examples for combinatorial optimisation
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- State identification and verification with satisfaction
- SAT-based automated completion for reachability analysis
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- Finding the hardest formulas for resolution
- Computing optimal hypertree decompositions with SAT
- Smt-Switch: a solver-agnostic C++ API for SMT solving
- Computing MUS-based inconsistency measures
Describes a project that uses
Uses Software
This page was built for publication: PySAT: a Python toolkit for prototyping with SAT oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1656601)
