{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T16:40:17Z","timestamp":1751820017928,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319993430"},{"type":"electronic","value":"9783319993447"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99344-7_21","type":"book-chapter","created":{"date-parts":[[2018,8,28]],"date-time":"2018-08-28T02:45:48Z","timestamp":1535424348000},"page":"228-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approaches for Enumerating All the Essential Prime Implicants"],"prefix":"10.1007","author":[{"given":"Yakoub","family":"Salhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,29]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Caruso, G.: A local selection algorithm for switching function minimization. IEEE Trans. Comput. C-33(1), 91\u201397 (1984)","DOI":"10.1109\/TC.1984.5009316"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Castell, T.: Computation of prime implicates and prime implicants by a variant of the Davis and Putnam procedure. In: Eigth International Conference on Tools with Artificial Intelligence, ICTAI 1996, pp. 428\u2013429 (1996)","DOI":"10.1109\/TAI.1996.560739"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Coudert, O., Madre, J.C.: Implicit and incremental computation of primes and essential primes of Boolean functions. In: Proceedings of the 29th Design Automation Conference, Anaheim, California, USA, pp. 36\u201339 (1992)","DOI":"10.1109\/DAC.1992.227866"},{"key":"21_CR4","unstructured":"Coudert, O., Madre, J.C.: A new method to compute prime and essential prime implicants of Boolean functions. In: Knight, T., Savage, J. (eds.) Proceedings of the 1992 Brown\/MIT Conference on Advanced Research in VLSI and Parallel Systems, pp. 113\u2013128 (1992)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"21_CR6","unstructured":"de Kleer, J., Mackworth, A.K., Reiter, R.: Characterizing diagnoses. In: Proceedings of the 8th National Conference on Artificial Intelligence (AAAI 1990), pp. 324\u2013330 (1990)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"D\u00e9harbe, D., Fontaine, P., Le Berre, D., Mazure, B.: Computing prime implicants. In: Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, pp. 46\u201352 (2013)","DOI":"10.1109\/FMCAD.2013.6679390"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"del Val, A.: Tractable databases: how to make propositional unit resolution complete through compilation. In Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR 1994), pp. 551\u2013561 (1994)","DOI":"10.1016\/B978-1-4832-1452-8.50146-9"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-24318-4_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"A Ignatiev","year":"2015","unstructured":"Ignatiev, A., Previti, A., Marques-Silva, J.: SAT-based formula simplification. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 287\u2013298. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_21"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-11558-0_11","volume-title":"Logics in Artificial Intelligence","author":"S Jabbour","year":"2014","unstructured":"Jabbour, S., Marques-Silva, J., Sais, L., Salhi, Y.: Enumerating prime implicants of propositional formulae in conjunctive normal form. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 152\u2013165. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11558-0_11"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Manquinho, V.M., Flores, P.F., Marques-Silva, J.P., Oliveira, A.L.: Prime implicant computation using satisfiability algorithms. In: 9th International Conference on Tools with Artificial Intelligence, ICTAI 1997, pp. 232\u2013239 (1997)","DOI":"10.1109\/TAI.1997.632261"},{"issue":"6","key":"21_CR12","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":"21_CR13","doi-asserted-by":"crossref","unstructured":"Pizzuti, C.: Computing prime implicants by integer programming. In: Eighth International Conference on Tools with Artificial Intelligence, ICTAI 1996, pp. 332\u2013336 (1996)","DOI":"10.1109\/TAI.1996.560473"},{"issue":"8","key":"21_CR14","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1080\/00029890.1952.11988183","volume":"59","author":"WV Quine","year":"1952","unstructured":"Quine, W.V.: The problem of simplifying truth functions. Am. Math. Monthly 59(8), 521\u2013531 (1952)","journal-title":"Am. Math. Monthly"},{"issue":"9","key":"21_CR15","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1080\/00029890.1959.11989404","volume":"66","author":"WV Quine","year":"1959","unstructured":"Quine, W.V.: On cores and prime implicants of truth functions. Am. Math. Monthly 66(9), 755\u2013760 (1959)","journal-title":"Am. Math. Monthly"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-24730-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Ravi","year":"2004","unstructured":"Ravi, K., Somenzi, F.: Minimal assignments for bounded model checking. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 31\u201345. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_3"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Rudell, R.L.: Multiple-valued logic minimization for PLA synthesis. Technical report, EECS Department, University of California, Berkeley (1986)","DOI":"10.21236\/ADA606736"},{"key":"21_CR18","unstructured":"Schrag, R.: Compilation for critically constrained knowledge bases. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 1996, IAAI 1996, pp. 510\u2013515 (1996)"},{"key":"21_CR19","unstructured":"Slavkovik, M., \u00c5gotnes, T.: A judgment set similarity measure based on prime implicants. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2014, pp. 1573\u20131574 (2014)"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0885-064X(92)90033-8","volume":"8","author":"T Strzemecki","year":"1992","unstructured":"Strzemecki, T.: Polynomial-time algorithms for generation of prime implicants. J. Complexity 8(1), 37\u201363 (1992)","journal-title":"J. Complexity"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Tison, P.: Generalization of consensus theory and application to the minimization of Boolean functions. IEEE Trans. Electron. Comput. EC-16(4), 446\u2013456 (1967)","DOI":"10.1109\/PGEC.1967.264648"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence: Methodology, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99344-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T16:03:26Z","timestamp":1751817806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99344-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319993430","9783319993447"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99344-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIMSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence: Methodology, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Varna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aimsa2018a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.aimsaconference.org\/","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":"72","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":"22","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":"7","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":"31% - 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,2","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":"4","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)"}}]}}