Solving the incremental satisfiability problem
From MaRDI portal
Publication:4036286
DOI10.1016/0743-1066(93)90018-CzbMath0787.68049MaRDI QIDQ4036286
Publication date: 16 May 1993
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (9)
Logic applied to integer programming and integer programming applied to logic ⋮ Incremental bounded model checking for embedded software ⋮ The incremental satisfiability problem for a two conjunctive normal form ⋮ Efficient bounded model checking of heap-manipulating programs using tight field bounds ⋮ Range and Set Abstraction using SAT ⋮ SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT ⋮ A rigorous methodology for specification and verification of business processes ⋮ New methods for computing inferences in first order logic ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
This page was built for publication: Solving the incremental satisfiability problem
