{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:01:20Z","timestamp":1743120080379,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031337826"},{"type":"electronic","value":"9783031337833"}],"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-33783-3_7","type":"book-chapter","created":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T23:02:39Z","timestamp":1686265359000},"page":"69-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Method for\u00a0Counting Models on\u00a0Cubic Boolean Formulas"],"prefix":"10.1007","author":[{"given":"Marco A.","family":"L\u00f3pez-Medina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Raymundo","family":"Marcial-Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 A.","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra","family":"Morales-Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,9]]},"reference":[{"key":"7_CR1","unstructured":"Buchanan, B.G., Lederberg, J.: The heuristic DENDRAL program for explaining empirical data. In: Freiman, C.V., Griffith, J.E., Rosenfeld, J.L. (eds.) Information Processing, Proceedings of IFIP Congress 1971, Volume 1 - Foundations and Systems, Ljubljana, Yugoslavia, August 23\u201328, 1971, pp. 179\u2013188. North-Holland (1971)"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"COXETER, H., FRUCHT, R., POWERS, D.L.: Dedication. In: Zero-Symmetric Graphs, pp. 1\u2013170. Academic Press (1981). https:\/\/doi.org\/10.1016\/B978-0-12-194580-0.50003-3","DOI":"10.1016\/B978-0-12-194580-0.50003-3"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A Darwiche","year":"2012","unstructured":"Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. J. Appl. Non-Classical Logics 11, 11\u201334 (2012)","journal-title":"J. Appl. Non-Classical Logics"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/jgt.3190010111","volume":"1","author":"R Frucht","year":"1977","unstructured":"Frucht, R.: A canonical representation of trivalent hamiltonian graphs. J. Graph Theor. 1(1), 45\u201360 (1977). https:\/\/doi.org\/10.1002\/jgt.3190010111","journal-title":"J. Graph Theor."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M., Kasiviswanathan, S.P.: Algorithms for counting 2-sat solutions and colorings with applications. In: Algorithmic Aspects in Information and Management, pp. 47\u201357. Springer, Berlin Heidelberg, Berlin, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72870-2_5"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"G. Brifhtwell, P.W.: Counting linear extensions. Order 8(e), 225\u2013242 (1991)","DOI":"10.1007\/BF00383444"},{"key":"7_CR7","unstructured":"J., L.: Dendral-64 - a system for computer construction, enumeration and notation of organic molecules as tree structures and cyclic graphs. Tech. rep., National Aeronautics and Space Administration. Grant NsG, pp. 81\u201360 (1965)"},{"key":"7_CR8","unstructured":"L\u00f3pez, M.A., Marcial-Romero, J.R., Hern\u00e1ndez, J.A., Ita, G.D.: Model counting for #2sat problem in outerplanar graphs. In: Proceedings of the Eleventh Latin American Workshop on Logic\/Languages, Algorithms and New Methods of Reasoning. vol. 2264, pp. 76\u201387. CEUR Workshop Proceedings (2018)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-92198-3_8","volume":"10880","author":"MA L\u00f3pez-Medina","year":"2018","unstructured":"L\u00f3pez-Medina, M.A., Marcial-Romero, J.R., Ita, G.D., Moyao, Y.: A linear time algorithm for computing #2SAT for outerplanar 2-CNF formulas. Lect. Notes Comput. Sci. 10880, 72\u201381 (2018)","journal-title":"Lect. Notes Comput. Sci."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Medina, M.A., Marcial-Romero, J.R., Ita, G.D., Valdovinos, R.M.: A fast and efficient method for #2sat via graph transformations. Advances in Soft Computing, pp. 95\u2013106 (2017)","DOI":"10.1007\/978-3-030-02837-4_8"},{"key":"7_CR11","unstructured":"L\u00f3pez-Medina, M.A., Marcial-Romero, J.R., Luna, G.D.I., Montes-Venegas, H.A., Alejo, R.: A linear time algorithm for solving #2SAT on cactus formulas. CoRR, ams\/1702.08581 (2017)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-030-60884-2_33","volume-title":"Advances in Soft Computing","author":"MA L\u00f3pez-Medina","year":"2020","unstructured":"L\u00f3pez-Medina, M.A., Marcial-Romero, J.R., De Ita-Luna, G., Hern\u00e1ndez, J.A.: A linear time algorithm for counting #2SAT on series-parallel formulas. In: Mart\u00ednez-Villase\u00f1or, L., Herrera-Alc\u00e1ntara, O., Ponce, H., Castro-Espinoza, F.A. (eds.) MICAI 2020. LNCS (LNAI), vol. 12468, pp. 437\u2013447. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60884-2_33"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Marcial-Romero, J.R., Ita, G.D., Hern\u00e1ndez, J.A., Valdovinos, R.M.: A parametric polynomial deterministic algorithm for #2sat. Lect. Notes Comput. Sci. 9413, 202\u2013213 (2015)","DOI":"10.1007\/978-3-319-27060-9_16"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artif. Intell. 82, 273\u2013302 (1996)","journal-title":"Artif. Intell."},{"key":"7_CR15","first-page":"188","volume-title":"On Fixed-Parameter Tractable Parametrizations of SAT","author":"S Szeider","year":"2004","unstructured":"Szeider, S.: On Fixed-Parameter Tractable Parametrizations of SAT, pp. 188\u2013202. Springer, Berlin Heidelberg pp (2004)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach. 29(3), 623\u2013641 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"7_CR17","first-page":"202","volume-title":"A tighter bound for counting max-weight solutions to 2sat instances","author":"M Wahlstr\u00f6m","year":"2008","unstructured":"Wahlstr\u00f6m, M.: A tighter bound for counting max-weight solutions to 2sat instances, pp. 202\u2013213. Springer, Berlin Heidelberg pp (2008)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33783-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T07:08:28Z","timestamp":1689750508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33783-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031337826","9783031337833"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33783-3_7","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":"9 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tepic","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcpr22023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ccc.inaoep.mx\/~mcpr\/index.html","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","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":"30","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":"0","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":"49% - 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":"2.754","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.58","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)"}}]}}