Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325852
DOI10.1007/b95238zbMath1204.68129OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325852
Dong Wang, Muralidhar Talupur, Helmut Veith, Edmund M. Clarke
Publication date: 24 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95238
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Extracting unsatisfiable cores for LTL via temporal resolution ⋮ SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Enhancing unsatisfiable cores for LTL with information on temporal relevance ⋮ Temporalization of Probabilistic Propositional Logic ⋮ Partial predicate abstraction and counter-example guided refinement
Uses Software
This page was built for publication: Theory and Applications of Satisfiability Testing
