Solving the incremental satisfiability problem
From MaRDI portal
Publication:4036286
DOI10.1016/0743-1066(93)90018-CzbMATH Open0787.68049MaRDI QIDQ4036286FDOQ4036286
Publication date: 16 May 1993
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Recommendations
- Incremental inprocessing in SAT solving
- An Incremental Branch-and-Bound Method for the Satisfiability Problem
- scientific article
- 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 (16)
- Title not available (Why is that?)
- A simple test improves checking satisfiability
- On an unsatisfiability-satisfiability prover
- The incremental satisfiability problem for a two conjunctive normal form
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
- Theory and Applications of Satisfiability Testing
- Improvements to Hybrid Incremental SAT Algorithms
- New methods for computing inferences in first order logic
- Range and set abstraction using SAT
- Efficient bounded model checking of heap-manipulating programs using tight field bounds
- An Incremental Branch-and-Bound Method for the Satisfiability Problem
- Logic applied to integer programming and integer programming applied to logic
- A rigorous methodology for specification and verification of business processes
- Incremental bounded model checking for embedded software
- On enumerating short projected models
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)
