PySAT: a Python toolkit for prototyping with SAT oracles
From MaRDI portal
Recommendations
Cited in
(57)- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Optimized SAT encoding of conformance checking artefacts
- OptiLog: a framework for SAT-based systems
- SAT-based rigorous explanations for decision lists
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Smt-Switch: a solver-agnostic C++ API for SMT solving
- Certified DQBF solving by definition extraction
- A SAT encoding to compute aperiodic tiling rhythmic canons
- Coupling different integer encodings for SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Learning MAX-SAT from contextual examples for combinatorial optimisation
- Cover combinatorial filters and their minimization problem
- PySAT
- Using merging variables-based local search to solve special variants of MaxSAT problem
- RC2: an efficient MaxSAT solver
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- Learning Optimal Decision Sets and Lists with SAT
- On Tackling Explanation Redundancy in Decision Trees
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- Finding the hardest formulas for resolution
- Evaluating ESOP Optimization Methods in Quantum Compilation Flows
- Witnesses for Answer Sets of Logic Programs
- Using a SAT Solver to Find Interesting Sets of Nonstandard Dice
- Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy
- Computing optimal hypertree decompositions with SAT
- State identification and verification with satisfaction
- Search of fractal space-filling curves with minimal dilation
- Explaining Hyperproperty Violations
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Computing MUS-based inconsistency measures
- Automatic search of linear structure: applications to \textsc{Keccak} and \textsc{Ascon}
- Joint learning of reward machines and policies in environments with partially known semantics
- Hashing-based approximate counting of minimal unsatisfiable subsets
- CNF encodings of symmetric functions
- SAT-based automated completion for reachability analysis
- Feature necessity and relevancy in machine learning explanations
- Validity of contextual formulas
- Optimal layout synthesis for deep quantum circuits on NISQ processors with 100+ qubits
- Towards universally accessible SAT technology
- Computing and certifying twin-width using logic
- Improved bounds on the domatic numbers of queens graphs
- Exact approaches for the diverse satisfiability problem
- Explanations of unsatisfiability beyond minimal subsets
- An exact and fast SAT formulation for the DCJ distance
- SAT-based bounded model checking for propositional projection temporal logic
- New models for the cryptanalysis of ASCON
- The chromatic number of 4-dimensional lattices
- A reinforcement learning approach for resolving inconsistencies in qualitative constraint networks
- Structure and computability of preimages in the Game of Life
- ICCMA 2023: 5th international competition on computational models of argumentation
- Computing aperiodic tiling rhythmic canons via SAT models
- Finding periodic apartments via Boolean satisfiability and orderly generation
- Declarative approaches to outcome determination in judgment aggregation
- NP-completeness on the length of double-arrays and the sparse matrix problem with at least logarithmic alphabets/widths
- North-east lattice paths avoiding k collinear points via satisfiability
- Looking for signs: reasoning about FOBNNs using SAT
- Explainability results for the rotating workforce scheduling problem
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)
