Pages that link to "Item:Q1656601"

The following pages link to PySAT: a Python toolkit for prototyping with SAT oracles (Q1656601):

Displaying 32 items.

• PySAT (Q37197) (← links)
• \(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)
• Coupling different integer encodings for SAT (Q2170178) (← 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)
• Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy (Q6046229) (← links)
• Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
• Search of fractal space-filling curves with minimal dilation (Q6156091) (← links)
• Efficiently explaining CSPs with unsatisfiable subset optimization (Q6535423) (← links)
• Computing MUS-based inconsistency measures (Q6545579) (← links)
• Automatic search of linear structure: applications to \textsc{Keccak} and \textsc{Ascon} (Q6575044) (← links)
• Joint learning of reward machines and policies in environments with partially known semantics (Q6579299) (← links)
• Hashing-based approximate counting of minimal unsatisfiable subsets (Q6632194) (← links)
• CNF encodings of symmetric functions (Q6635697) (← links)
• SAT-based automated completion for reachability analysis (Q6666788) (← links)