Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325867
DOI10.1007/B95238zbMATH Open1204.68180DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325867FDOQ5325867
Daniel Jackson, Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)
Cited In (12)
- A general framework for enumerating equivalence classes of solutions
- Symbolic techniques in satisfiability solving
- Title not available (Why is that?)
- Disjunctive closures for knowledge compilation
- Fast, flexible MUS enumeration
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems
- Improving the performance of enumerative search methods. II: Computational experiments
- A Study of Symmetry Breaking Predicates and Model Counting
- Testing-Based Formal Verification for Theorems and Its Application in Software Specification Verification
- Title not available (Why is that?)
- Enumerating All Solutions for Constraint Satisfaction Problems
- Enriching Solutions to Combinatorial Problems via Solution Engineering
Uses Software
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 Q5325867)
