{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:30:35Z","timestamp":1743118235782,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031457838"},{"type":"electronic","value":"9783031457845"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45784-5_11","type":"book-chapter","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T17:01:40Z","timestamp":1697389300000},"page":"169-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel EGs-Based Framework for\u00a0Systematic Propositional-Formula Simplification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-6608-4051","authenticated-orcid":false,"given":"Jordina","family":"Franc\u00e8s de Mas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5918-9114","authenticated-orcid":false,"given":"Juliana","family":"Bowles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"11_CR1","unstructured":"Anders, M.: SAT preprocessors and symmetry. In: Meel, K.S., Strichman, O. (eds.) 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, 2\u20135 August 2022, Haifa, Israel. LIPIcs, vol.\u00a0236, pp. 1:1\u20131:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2022.1"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90002-4","journal-title":"Inf. Process. Lett."},{"key":"11_CR3","unstructured":"Bacchus, F.: Enhancing davis putnam with extended binary clause reasoning. In: Dechter, R., Kearns, M.J., Sutton, R.S. (eds.) Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, 28 July\u20131 August 2002, Edmonton, Alberta, Canada, pp. 613\u2013619. AAAI Press\/The MIT Press (2002). http:\/\/www.aaai.org\/Library\/AAAI\/2002\/aaai02-092.php"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S1571-0653(04)00314-2","volume":"9","author":"DL Berre","year":"2001","unstructured":"Berre, D.L.: Exploiting the real power of unit propagation lookahead. Electron. Notes Discret. Math. 9, 59\u201380 (2001). https:\/\/doi.org\/10.1016\/S1571-0653(04)00314-2","journal-title":"Electron. Notes Discret. Math."},{"key":"11_CR5","unstructured":"Biere, A.: Resolve and expand. In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10\u201313 May 2004, Vancouver, BC, Canada, Online Proceedings (2004). http:\/\/www.satisfiability.org\/SAT04\/programme\/93.pdf"},{"key":"11_CR6","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2020 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Biere, A., J\u00e4rvisalo, M., Kiesl, B.: Preprocessing in SAT solving. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability - Second Edition, Frontiers in Artificial Intelligence and Applications, vol. 336, pp. 391\u2013435. IOS Press (2021). https:\/\/doi.org\/10.3233\/FAIA200992","DOI":"10.3233\/FAIA200992"},{"key":"11_CR8","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Transitive closure of a directed graph. In: Introduction to Algorithms, pp. 632\u2013634 (2001)"},{"key":"11_CR9","unstructured":"Dau, F.: Mathematical logic with diagrams \u2013 based on the existential graphs of peirce. Habilitation thesis. TU Darmstadt, Germany (2008). http:\/\/www.dr-dau.net\/Papers\/habil.pdf"},{"key":"11_CR10","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall (1976). https:\/\/www.worldcat.org\/oclc\/01958445"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-72788-0_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"N Een","year":"2007","unstructured":"Een, N., Mishchenko, A., S\u00f6rensson, N.: Applying logic synthesis for speeding up SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 272\u2013286. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72788-0_26"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-030-24258-9_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"K Fazekas","year":"2019","unstructured":"Fazekas, K., Biere, A., Scholl, C.: Incremental inprocessing in SAT solving. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 136\u2013154. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_9"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10472-005-0433-5","volume":"43","author":"AV Gelder","year":"2005","unstructured":"Gelder, A.V.: Toward leaner binary-clause reasoning in a satisfiability solver. Ann. Math. Artif. Intell. 43(1), 239\u2013253 (2005). https:\/\/doi.org\/10.1007\/s10472-005-0433-5","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Gelder, A.V., Tsuji, Y.K.: Satisfiability testing with more reasoning and less guessing. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 11\u201313 October 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 559\u2013586. DIMACS\/AMS (1993). https:\/\/doi.org\/10.1090\/dimacs\/026\/27","DOI":"10.1090\/dimacs\/026\/27"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-16242-8_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M Heule","year":"2010","unstructured":"Heule, M., J\u00e4rvisalo, M., Biere, A.: Clause elimination procedures for CNF formulas. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 357\u2013371. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_26"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-21581-0_17","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"MJH Heule","year":"2011","unstructured":"Heule, M.J.H., J\u00e4rvisalo, M., Biere, A.: Efficient CNF simplification based on binary implication graphs. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 201\u2013215. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21581-0_17"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-31365-3_28","volume-title":"Automated Reasoning","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Heule, M.J.H., Biere, A.: Inprocessing rules. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 355\u2013370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_28"},{"issue":"5","key":"11_CR18","first-page":"593","volume":"72","author":"M Karnaugh","year":"1953","unstructured":"Karnaugh, M.: The map method for synthesis of combinational logic circuits. Trans. Am. Inst. Electr. Eng. Part I Communi. Electron. 72(5), 593\u2013599 (1953)","journal-title":"Trans. Am. Inst. Electr. Eng. Part I Communi. Electron."},{"key":"11_CR19","unstructured":"Li, C.M.: Integrating equivalency reasoning into davis-putnam procedure. In: Kautz, H.A., Porter, B.W. (eds.) Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, 30 July\u20133 August 2000, Austin, Texas, USA, pp. 291\u2013296. AAAI Press\/The MIT Press (2000). http:\/\/www.aaai.org\/Library\/AAAI\/2000\/aaai00-045.php"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Li, C., Xiao, F., Luo, M., Many\u00e0, F., L\u00fc, Z., Li, Y.: Clause vivification by unit propagation in CDCL SAT solvers. Artif. Intell. 279 (2020). https:\/\/doi.org\/10.1016\/j.artint.2019.103197","DOI":"10.1016\/j.artint.2019.103197"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Luo, M., Li, C., Xiao, F., Many\u00e0, F., L\u00fc, Z.: An effective learnt clause minimization approach for CDCL SAT solvers. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 703\u2013711. ijcai.org (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/98","DOI":"10.24963\/ijcai.2017\/98"},{"issue":"6","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1002\/j.1538-7305.1956.tb03835.x","volume":"35","author":"EJ McCluskey","year":"1956","unstructured":"McCluskey, E.J.: Minimization of boolean functions. Bell Syst. Tech. J. 35(6), 1417\u20131444 (1956)","journal-title":"Bell Syst. Tech. J."},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, 18\u201322 June 2001, pp. 530\u2013535. ACM (2001). https:\/\/doi.org\/10.1145\/378239.379017","DOI":"10.1145\/378239.379017"},{"key":"11_CR24","unstructured":"Peirce, C.: Existential graphs: manuscript 514, with commentary by jf sowa. Self-published by JF Sowa (1909). http:\/\/www.jfsowa.com\/peirce\/ms514.htm"},{"key":"11_CR25","unstructured":"Roberts, D.D.: The existential graphs of Charles S. Peirce. Ph.D. thesis, University of Illinois at Urbana-Champaign (1963)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Roberts, D.D.: The existential graphs of Charles S. Peirce. Mouton (1973)","DOI":"10.1515\/9783110226225"},{"key":"11_CR27","unstructured":"Rudell, R.L.: Logic synthesis for VLSI design. Ph.D. thesis, University of California, Berkeley (1989)"},{"issue":"1","key":"11_CR28","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0771-050X(81)90010-3","volume":"7","author":"M Sharir","year":"1981","unstructured":"Sharir, M.: A strong-connectivity algorithm and its applications in data flow analysis. Comput. Math. Appl. 7(1), 67\u201372 (1981)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1008303204427","volume":"8","author":"S Shin","year":"1999","unstructured":"Shin, S.: Reconstituting beta graphs into an efficacious system. J. Log. Lang. Inf. 8(3), 273\u2013295 (1999). https:\/\/doi.org\/10.1023\/A:1008303204427","journal-title":"J. Log. Lang. Inf."},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-02777-2_23","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"N S\u00f6rensson","year":"2009","unstructured":"S\u00f6rensson, N., Biere, A.: Minimizing learned clauses. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 237\u2013243. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_23"},{"issue":"186","key":"11_CR31","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1515\/semi.2011.060","volume":"2011","author":"JF Sowa","year":"2011","unstructured":"Sowa, J.F.: Peirce\u2019s tutorial on existential graphs. Semiotica 2011(186), 347\u2013394 (2011)","journal-title":"Semiotica"},{"issue":"2","key":"11_CR32","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972). https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J. Comput."},{"key":"11_CR33","unstructured":"Zeman, J.J.: The graphical logic of C. S. Peirce. Ph.D. thesis, The University of Chicago (1964)"},{"issue":"1\/2","key":"11_CR34","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1006351428454","volume":"24","author":"H Zhang","year":"2000","unstructured":"Zhang, H., Stickel, M.E.: Implementing the davis-putnam method. J. Autom. Reason. 24(1\/2), 277\u2013296 (2000). https:\/\/doi.org\/10.1023\/A:1006351428454","journal-title":"J. Autom. Reason."},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/11499107_42","volume-title":"Theory and Applications of Satisfiability Testing","author":"L Zhang","year":"2005","unstructured":"Zhang, L.: On subsumption removal and on-the-fly CNF simplification. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 482\u2013489. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499107_42"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45784-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T18:11:21Z","timestamp":1697393481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45784-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031457838","9783031457845"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45784-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cascais","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lopstr.github.io\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}