{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T18:20:59Z","timestamp":1747592459382},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262763"},{"type":"electronic","value":"9783540316794"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11499107_42","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T17:56:25Z","timestamp":1279130185000},"page":"482-489","source":"Crossref","is-referenced-by-count":21,"title":["On Subsumption Removal and On-the-Fly CNF Simplification"],"prefix":"10.1007","author":[{"given":"Lintao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Tran. on Computers\u00a048, 506\u2013521 (1999)","journal-title":"IEEE Tran. on Computers"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46135-3_14","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: Towards Symmetric Treatment of Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 200. Springer, Heidelberg (2002)"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11527695_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"A. Biere","year":"2005","unstructured":"Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11527695_22","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Subbarayan","year":"2005","unstructured":"Subbarayan, S., Pradhan, D.K.: NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 276\u2013291. Springer, Heidelberg (2005)"},{"key":"42_CR6","unstructured":"Chauhan, P., Clarke, E.M., Kroening, D.: Using SAT Based Image Computation for Reachability Analysis. Technical Report CMU-CS-03-151, Carnegie Mellon University (July 2003)"},{"key":"42_CR7","unstructured":"de Kleer, J.: An Improved Incremental Algorithm for Generating Prime Implicates. In: Proc. of the 10th National Conference on Artificial Intelligence, AAAI 1992 (1992)"},{"key":"42_CR8","unstructured":"Chatalic, P., Simon, L.: Multi-Resolution on Compressed Sets of Clauses. In: Twelfth International Conference on Tools with Artificial Intelligence, ICTAI 2000 (2000)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-Suppressed BDDs for Set Manipula-tion in Combinatorial Problems. In: Proc. of the Design Automation Conference (DAC 1993), pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"42_CR10","volume-title":"Logic Sysntheiss and Verification Algorithms","author":"G. Hachtel","year":"1996","unstructured":"Hachtel, G., Somenzi, F.: Logic Sysntheiss and Verification Algorithms. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Kang, H.J., Park, I.-C.: SAT-Based Unbounded Symbolic Model Checking. In: Proc. 40th Design Automation Conference, DAC 2003 (2003)","DOI":"10.1145\/775832.776043"},{"key":"42_CR12","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Engineering an efficient SAT Solver. In: Proceedings of the Design Automation Conference (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:14:01Z","timestamp":1558282441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11499107_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}