Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68129DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325852FDOQ5325852

Dong Wang, Edmund Clarke, Muralidhar Talupur, Helmut Veith

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (7)

• Extracting unsatisfiable cores for LTL via temporal resolution
• Towards a notion of unsatisfiable and unrealizable cores for LTL
• Enhancing unsatisfiable cores for LTL with information on temporal relevance
• SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers
• An abstraction algorithm for the verification of level-sensitive latch-based netlists
• Temporalization of Probabilistic Propositional Logic
• Partial predicate abstraction and counter-example guided refinement

Uses Software

• Chaff

This page was built for publication: Theory and Applications of Satisfiability Testing

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