Solving the incremental satisfiability problem
From MaRDI portal
Publication:4036286
Recommendations
- Incremental inprocessing in SAT solving
- An Incremental Branch-and-Bound Method for the Satisfiability Problem
- scientific article; zbMATH DE number 5575002
- Theory and Applications of Satisfiability Testing
- Improvements to Hybrid Incremental SAT Algorithms
- The incremental satisfiability problem for a two conjunctive normal form
- Solving Satisfiability with Less Searching
- On using incremental encodings in unsatisfiability-based MaxSAT solving
Cited in
(19)- On an unsatisfiability-satisfiability prover
- A rigorous methodology for specification and verification of business processes
- Efficient bounded model checking of heap-manipulating programs using tight field bounds
- Improvements to Hybrid Incremental SAT Algorithms
- scientific article; zbMATH DE number 1903356 (Why is no real title available?)
- On enumerating short projected models
- An Incremental Branch-and-Bound Method for the Satisfiability Problem
- SAT modulo intuitionistic implications
- Ultimately incremental SAT
- New methods for computing inferences in first order logic
- Logic applied to integer programming and integer programming applied to logic
- Incremental bounded model checking for embedded software
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- A simple test improves checking satisfiability
- The incremental satisfiability problem for a two conjunctive normal form
- Range and set abstraction using SAT
- Mining backbone literals in incremental SAT. A new kind of incremental data
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- Theory and Applications of Satisfiability Testing
This page was built for publication: Solving the incremental satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036286)
