Theory and applications of satisfiability testing -- SAT 2007. 10th international conference, Lisbon, Portugal, May 28--31, 2007. Proceedings

DOI10.1007/978-3-540-72788-0MaRDI QIDQ2454615zbMATH OpenOpenAlexFDO

Authors

Publication date 16 October 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72788-0

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(4)

• A Compact Representation for Syntactic Dependencies in QBFs
• Failed literal detection for QBF
• Present and Future of Practical SAT Solving
• Theory and applications of satisfiability testing. 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10--13, 2004. Revised selected papers.

This page was built for publication: Theory and applications of satisfiability testing -- SAT 2007. 10th international conference, Lisbon, Portugal, May 28--31, 2007. Proceedings

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