Itauto: An Extensible Intuitionistic SAT Solver

DOI10.4230/LIPICS.ITP.2021.9MaRDI QIDQ6157250zbMATH OpenOpenAlexFDO

Authors Frédéric Besson

Publication date 20 June 2023

Full work available at URL https://hal.inria.fr/hal-03508736

zbMATH Keywords

SAT solverproof by reflection

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• AUTO2, a saturation-based heuristic prover for higher-order logic
• Theory and Applications of Satisfiability Testing
• Automated benchmarking of incremental SAT and QBF solvers
• On the use of autarkies for satisfiability decision
• Mechanizing Mathematical Reasoning
• Satallax: An Automatic Higher-Order Prover
• Theory and Applications of Satisfiability Testing
• SATenstein: automatically building local search SAT solvers from components
• Automating Induction with an SMT Solver
• ASSAT: computing answer sets of a logic program by SAT solvers

Cited in

(1)

• On the use of autarkies for satisfiability decision

This page was built for publication: Itauto: An Extensible Intuitionistic SAT Solver

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