Towards universally accessible SAT technology

DOI10.4230/LIPICS.SAT.2024.16MaRDI QIDQ6864428zbMATH OpenFDO

Authors A. A. Ignatiev, Zi Li Tan, Christos Karamanos

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.16

zbMATH Keywords

practical applicabilityprototypingPySATpython

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Algorithms for implicit hitting set problems
• Cardinality Networks and Their Applications
• Chronological backtracking
• GRASP: a search algorithm for propositional satisfiability
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
• IPASIR-up: user propagators for CDCL
• Learning rate based branching heuristic for SAT solvers
• Optilog V2: model, solve, tune and run
• OptiLog: a framework for SAT-based systems
• PBLib -- a library for encoding pseudo-Boolean constraints into CNF
• PySAT: a Python toolkit for prototyping with SAT oracles
• RC2: an efficient MaxSAT solver
• SAT race 2015
• Satisfiability modulo theories
• Temporal induction by incremental SAT solving
• The \textsc{MergeSat} solver
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling

Cited in

(2)

• Exact approaches for the diverse satisfiability problem
• On extracting legal arguments

This page was built for publication: Towards universally accessible SAT technology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864428)