Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68206DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325879FDOQ5325879

Authors: Maher Mneimneh, Karem A. Sakallah 

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

Recommendations

• Computing the eccentricity distribution of large graphs
• scientific article; zbMATH DE number 5542982
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 5719280
• Antichain-Based QBF Solving

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (9)

• Solving QBF with counterexample guided refinement
• Inverse eccentric vertex problem on networks
• Planning as satisfiability: parallel plans and algorithms for plan search
• A self-adaptive multi-engine solver for quantified Boolean formulas
• Abstraction-based algorithm for 2QBF
• 2QBF: challenges and solutions
• Compressing BMC encodings with QBF
• Optimal algorithms for inverse eccentric vertex location problem on extended star networks
• Learning to integrate deduction and search in reasoning about quantified Boolean formulas

Uses Software

• Chaff
• Quaffle

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 Q5325879)