{"id":"https://openalex.org/W1568384982","doi":"https://doi.org/10.1109/iscas.2003.1206203","title":"A Boolean extraction technique for multiple-level logic optimization","display_name":"A Boolean extraction technique for multiple-level logic optimization","publication_year":2003,"publication_date":"2003-11-04","ids":{"openalex":"https://openalex.org/W1568384982","doi":"https://doi.org/10.1109/iscas.2003.1206203","mag":"1568384982"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2003.1206203","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1206203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111455454","display_name":"Oh-Hyeong Kwon","orcid":null},"institutions":[{"id":"https://openalex.org/I187204187","display_name":"Gyeongju University","ror":"https://ror.org/00p8em311","country_code":"KR","type":"education","lineage":["https://openalex.org/I187204187"]},{"id":"https://openalex.org/I204626148","display_name":"Uiduk University","ror":"https://ror.org/01jt32312","country_code":"KR","type":"education","lineage":["https://openalex.org/I204626148"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Oh-Hyeong Kwon","raw_affiliation_strings":["Division of Computer and Multimedia Engineering, Ui-Duk University, Gyeongju, Gyeongbuk, South Korea","Div. of Comput. & Multimedia Eng., Uiduk Univ., Gyeongju, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Computer and Multimedia Engineering, Ui-Duk University, Gyeongju, Gyeongbuk, South Korea","institution_ids":["https://openalex.org/I187204187"]},{"raw_affiliation_string":"Div. of Comput. & Multimedia Eng., Uiduk Univ., Gyeongju, South Korea","institution_ids":["https://openalex.org/I204626148"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111455454"],"corresponding_institution_ids":["https://openalex.org/I187204187","https://openalex.org/I204626148"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.05734504,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"4","issue":null,"first_page":"IV","last_page":"684"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.7884955406188965},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.7442119717597961},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.7329326272010803},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.7224711775779724},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6996585726737976},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.63746178150177},{"id":"https://openalex.org/keywords/standard-boolean-model","display_name":"Standard Boolean model","score":0.6330698132514954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6266676187515259},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.5821850895881653},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5693067312240601},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5170431733131409},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.4777854382991791},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4677588641643524},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4413120448589325},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.441049188375473},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4267517626285553},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4165676236152649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37752455472946167},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.3345676064491272},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.32742005586624146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2784964442253113},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.0828636884689331}],"concepts":[{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.7884955406188965},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.7442119717597961},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.7329326272010803},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.7224711775779724},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6996585726737976},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.63746178150177},{"id":"https://openalex.org/C68481662","wikidata":"https://www.wikidata.org/wiki/Q176197","display_name":"Standard Boolean model","level":5,"score":0.6330698132514954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6266676187515259},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.5821850895881653},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5693067312240601},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5170431733131409},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.4777854382991791},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4677588641643524},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4413120448589325},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.441049188375473},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4267517626285553},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4165676236152649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37752455472946167},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.3345676064491272},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.32742005586624146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2784964442253113},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.0828636884689331},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2003.1206203","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2003.1206203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W74262062","https://openalex.org/W2036887642","https://openalex.org/W2062074890","https://openalex.org/W2102843836","https://openalex.org/W2152173554","https://openalex.org/W6603008813","https://openalex.org/W6665947723"],"related_works":["https://openalex.org/W2131164334","https://openalex.org/W4231391991","https://openalex.org/W2540591360","https://openalex.org/W1568384982","https://openalex.org/W2516690985","https://openalex.org/W2289022454","https://openalex.org/W2187008505","https://openalex.org/W2039485990","https://openalex.org/W2327772356","https://openalex.org/W1745650241"],"abstract_inverted_index":{"Extraction":[0,43],"is":[1,11,44,61,93],"the":[2,34,53,88,117],"most":[3],"important":[4],"step":[5],"in":[6,39,69,105,113,119],"global":[7],"minimization.":[8],"Its":[9],"approach":[10],"to":[12,23,32,52,86,94],"identify":[13,95],"and":[14,57,96],"extract":[15,97],"subexpressions,":[16],"which":[17,28],"are":[18],"multiple-cubes":[19],"or":[20,25,49],"single-cubes,":[21],"common":[22,71],"two":[24],"more":[26],"expressions":[27],"can":[29],"be":[30],"used":[31],"reduce":[33],"total":[35],"number":[36],"of":[37,63],"literals":[38],"a":[40,80,106],"Boolean":[41,59,72,84,99,107],"network.":[42,108],"described":[45],"as":[46],"either":[47],"algebraic":[48],"Boolean,":[50],"according":[51],"trade-off":[54],"between":[55],"run-time":[56],"optimization.":[58],"extraction":[60,85,118],"capable":[62],"providing":[64],"better":[65],"results,":[66],"but":[67],"difficulty":[68],"finding":[70],"divisors":[73],"arises.":[74],"In":[75],"this":[76],"paper,":[77],"we":[78],"present":[79],"new":[81],"method":[82],"for":[83,121],"remove":[87],"difficulty.":[89],"The":[90],"key":[91],"idea":[92],"two-cube":[98],"subexpression":[100],"pairs":[101],"from":[102],"each":[103],"expression":[104],"Experimental":[109],"results":[110],"show":[111],"improvements":[112],"literal":[114],"counts":[115],"over":[116],"SIS":[120],"some":[122],"benchmark":[123],"circuits.":[124]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}