{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:27:51Z","timestamp":1768285671491,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642224379","type":"print"},{"value":"9783642224386","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22438-6_19","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T18:21:44Z","timestamp":1311013304000},"page":"237-251","source":"Crossref","is-referenced-by-count":18,"title":["Compression of Propositional Resolution Proofs via Partial Regularization"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Fontaine","sequence":"first","affiliation":[]},{"given":"Stephan","family":"Merz","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Woltzenlogel Paleo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, O., Fuhrmann, O., Hoory, S., Shacham, O., Strichman, O.: Linear-time reductions of resolution proofs. Hardware and Software: Verification and Testing, 114\u2013128 (2009)","DOI":"10.1007\/978-3-642-01702-5_14"},{"key":"19_CR2","first-page":"825","volume-title":"Satisfiability Modulo Theories. Frontiers in Artificial Intelligence and Applications","author":"C. Barrett","year":"2009","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability Modulo Theories. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp. 825\u2013885. IOS Press, Amsterdam (2009)"},{"key":"19_CR3","volume-title":"Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications","year":"2009","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam (2009)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-02959-2_12","volume-title":"Automated Deduction \u2013 CADE-22","author":"T. Bouton","year":"2009","unstructured":"Bouton, T., de Oliveira, D. C.B., D\u00e9harbe, D., Fontaine, P.: veriT: An open, trustable and efficient SMT-solver. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol.\u00a05663, pp. 151\u2013156. Springer, Heidelberg (2009)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-14186-7_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"S. Cotton","year":"2010","unstructured":"Cotton, S.: Two techniques for minimizing resolution proofs. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 306\u2013312. Springer, Heidelberg (2010)"},{"key":"19_CR6","unstructured":"Fontaine, P., Merz, S., Woltzenlogel Paleo, B.: Exploring and Exploiting Algebraic and Graphical Properties of Resolution. In: 8th International Workshop on Satisfiability Modulo Theories (Part of FLoC - Federated Logic Conferences) (2010)"},{"key":"19_CR7","first-page":"106","volume-title":"Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1997","author":"G.C. Necula","year":"1997","unstructured":"Necula, G.C.: Proof-carrying code. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1997, pp. 106\u2013119. ACM, New York (1997)"},{"key":"19_CR8","unstructured":"Odersky, M., Spoon, L., Venners, B.: Programming in Scala. Artima Press (2008)"},{"key":"19_CR9","unstructured":"Simone, S., Brutomesso, R., Sharygina, N.: An efficient and flexible approach to resolution proof reduction. In: 6th Haifa Verification Conference (2010)"},{"key":"19_CR10","first-page":"1967","volume-title":"Automation of Reasoning: Classical Papers in Computational Logic","author":"G. Tseitin","year":"1983","unstructured":"Tseitin, G.: On the complexity of proofs in propositional logics. In: Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning: Classical Papers in Computational Logic, vol.\u00a02, pp. 1967\u20131970. Springer, Heidelberg (1983)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-23"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22438-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:10:01Z","timestamp":1553915401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22438-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224379","9783642224386"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22438-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}