{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:48Z","timestamp":1725490188420},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642304729"},{"type":"electronic","value":"9783642304736"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30473-6_14","type":"book-chapter","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T11:29:12Z","timestamp":1337945352000},"page":"163-168","source":"Crossref","is-referenced-by-count":4,"title":["A Framework for the Specification of Random SAT and QSAT Formulas"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]},{"given":"Uwe","family":"Egly","sequence":"additional","affiliation":[]},{"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"qbfGen Project Site, \n                    \n                      http:\/\/fmv.jku.at\/qbfgen\/"},{"issue":"1-4","key":"14_CR2","first-page":"133","volume":"5","author":"M. Benedetti","year":"2008","unstructured":"Benedetti, M., Mangassarian, H.: QBF-Based Formal Verification: Experience and Perspectives. JSAT\u00a05(1-4), 133\u2013191 (2008)","journal-title":"JSAT"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-14186-7_6","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"R. Brummayer","year":"2010","unstructured":"Brummayer, R., Lonsing, F., Biere, A.: Automated Testing and Debugging of SAT and QBF Solvers. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 44\u201357. Springer, Heidelberg (2010)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Chen, H., Interian, Y.: A Model for Generating Random Quantified Boolean Formulas. In: Proc. of IJCAI 2005, pp. 66\u201371. Professional Book Center (2005)","DOI":"10.1007\/11527695_6"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-02777-2_34","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"N. Creignou","year":"2009","unstructured":"Creignou, N., Daud\u00e9, H., Egly, U., Rossignol, R.: (1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 363\u2013376. Springer, Heidelberg (2009)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24605-3_17","volume-title":"Theory and Applications of Satisfiability Testing","author":"U. Egly","year":"2004","unstructured":"Egly, U., Seidl, M., Tompits, H., Woltran, S., Zolda, M.: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 214\u2013228. Springer, Heidelberg (2004)"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s10601-008-9055-y","volume":"14","author":"U. Egly","year":"2009","unstructured":"Egly, U., Seidl, M., Woltran, S.: A solver for QBFs in negation normal form. Constraints\u00a014(1), 38\u201379 (2009)","journal-title":"Constraints"},{"key":"14_CR8","unstructured":"Gent, I., Walsh, T.: Beyond NP: The QSAT Phase Transition. In: Proc. of AAAI\/IAAI 1999, pp. 648\u2013653 (1999)"},{"key":"14_CR9","unstructured":"Gent, I.P., Walsh, T.: The SAT Phase Transition. In: Proc. of ECAI 1994, pp. 105\u2013109 (1994)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-02777-2_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"A. Goultiaeva","year":"2009","unstructured":"Goultiaeva, A., Iverson, V., Bacchus, F.: Beyond CNF: A Circuit-Based QBF Solver. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 412\u2013426. Springer, Heidelberg (2009)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-14186-7_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"W. Klieber","year":"2010","unstructured":"Klieber, W., Sapra, S., Gao, S., Clarke, E.: A Non-Prenex, Non-Clausal QBF Solver with Game-State Learning. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 128\u2013142. Springer, Heidelberg (2010)"},{"issue":"3-4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<414::AID-RSA10>3.0.CO;2-G","volume":"15","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: 2+p-sat: Relation of typical-case complexity to the nature of the phase transition. Random Struct. Algorithms\u00a015(3-4), 414\u2013435 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"14_CR13","unstructured":"Navarro, J., Voronkov, A.: Generation of Hard Non-Clausal Random Satisfiability Problems. In: Proc. AAAI\/IAAI 2005, pp. 436\u2013442 (2005)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","volume":"7","author":"M.R. Prasad","year":"2005","unstructured":"Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in SAT-based formal verification. STTT\u00a07(2), 156\u2013173 (2005)","journal-title":"STTT"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30473-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:54:39Z","timestamp":1558299279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30473-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642304729","9783642304736"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30473-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}