The following pages link to PySAT (Q37197):
Displaying 20 items.
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Optimized SAT encoding of conformance checking artefacts (Q2019685) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
- Smt-Switch: a solver-agnostic C++ API for SMT solving (Q2118327) (← links)
- Certified DQBF solving by definition extraction (Q2118343) (← links)
- A SAT encoding to compute aperiodic tiling rhythmic canons (Q2170172) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Learning MAX-SAT from contextual examples for combinatorial optimisation (Q2680761) (← links)
- Cover Combinatorial Filters and Their Minimization Problem (Q3381953) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- RC2: an Efficient MaxSAT Solver (Q5015603) (← links)
- Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)
- Learning Optimal Decision Sets and Lists with SAT (Q5026234) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- (Q5109519) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Evaluating ESOP Optimization Methods in Quantum Compilation Flows (Q5237224) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
