Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325867
DOI10.1007/b95238zbMath1204.68180DBLPconf/sat/2003OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325867
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
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
A Study of Symmetry Breaking Predicates and Model Counting ⋮ Symbolic techniques in satisfiability solving ⋮ Disjunctive closures for knowledge compilation ⋮ Testing-Based Formal Verification for Theorems and Its Application in Software Specification Verification
Uses Software
This page was built for publication: Theory and Applications of Satisfiability Testing
