{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:25:43Z","timestamp":1729668343011,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/sisy.2013.6662583","type":"proceedings-article","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T16:58:50Z","timestamp":1385571530000},"page":"265-269","source":"Crossref","is-referenced-by-count":2,"title":["How to generate weakly nondecisive SAT instances"],"prefix":"10.1109","author":[{"given":"Csaba","family":"Biro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabor","family":"Kusper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Tajti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00037-2"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00017-6"},{"key":"10","first-page":"530535","article-title":"Engineering an efficient SAT solver","author":"moskewicz","year":"2001","journal-title":"Design Automation Conference"},{"key":"1","article-title":"Propositional Search with k-Clause Introduction Can be Polynomially Simulated by Resolution","author":"gelder","year":"0","journal-title":"Proceedings of the 5th International Symposium on Artificial Intelligence and Mathematics 1998"},{"key":"7","first-page":"220227","article-title":"GRASP: A new search algorithm for satisability","volume":"1166","author":"marques-silva","year":"1996","journal-title":"LNCS"},{"key":"6","first-page":"115","article-title":"On the Complexity of Derivation in Propositional Calculus","volume":"8","author":"tseitin","year":"1968","journal-title":"Math Seminar"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69912-5_11"},{"key":"4","first-page":"1","author":"kusper","year":"2005","journal-title":"Solving and Simplifying the Propositional Satisfiability Problem by Sub-Model Propagation"},{"key":"9","first-page":"431437","article-title":"Boosting combinatorial search through randomization","author":"gomes","year":"1998","journal-title":"National Conference on Articial Intelligence"},{"key":"8","doi-asserted-by":"crossref","first-page":"506521","DOI":"10.1109\/12.769433","article-title":"GRASP-A search algorithm for propositional satisability","volume":"48","author":"marques-silva","year":"1999","journal-title":"IEEE Transactions on Computers"}],"event":{"name":"2013 IEEE 11th International Symposium on Intelligent Systems and Informatics (SISY 2013)","start":{"date-parts":[[2013,9,26]]},"location":"Subotica, Serbia","end":{"date-parts":[[2013,9,28]]}},"container-title":["2013 IEEE 11th International Symposium on Intelligent Systems and Informatics (SISY)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6656129\/6662538\/06662583.pdf?arnumber=6662583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T23:16:55Z","timestamp":1498087015000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6662583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/sisy.2013.6662583","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}