{"id":"https://openalex.org/W2119294167","doi":"https://doi.org/10.1109/ismvl.2004.1319949","title":"A graph-theoretical approach to Boolean interpolation of non-Boolean functions","display_name":"A graph-theoretical approach to Boolean interpolation of non-Boolean functions","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W2119294167","doi":"https://doi.org/10.1109/ismvl.2004.1319949","mag":"2119294167"},"language":"en","primary_location":{"id":"doi:10.1109/ismvl.2004.1319949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2004.1319949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 34th International Symposium on Multiple-Valued Logic","raw_type":"proceedings-article"},"type":"article","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/A5028060193","display_name":"Sergiu Rudeanu","orcid":null},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"S. Rudeanu","raw_affiliation_strings":["Faculty of Mathematics, University of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072140970","display_name":"Dan A. Simovici","orcid":null},"institutions":[{"id":"https://openalex.org/I33434090","display_name":"University of Massachusetts Boston","ror":"https://ror.org/04ydmy275","country_code":"US","type":"education","lineage":["https://openalex.org/I33434090"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.A. Simovici","raw_affiliation_strings":["Department of Computer Science, University of Massachusetts, Boston, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Boston, USA","institution_ids":["https://openalex.org/I33434090"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028060193"],"corresponding_institution_ids":["https://openalex.org/I141595442"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.17828664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"52","issue":null,"first_page":"245","last_page":"250"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9681000113487244,"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"}},"topics":[{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9681000113487244,"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"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9254999756813049,"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.7458158731460571},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.6959654092788696},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6827945709228516},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.6654855012893677},{"id":"https://openalex.org/keywords/complete-boolean-algebra","display_name":"Complete Boolean algebra","score":0.631397008895874},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.6219490766525269},{"id":"https://openalex.org/keywords/boolean-algebras-canonically-defined","display_name":"Boolean algebras canonically defined","score":0.5833616852760315},{"id":"https://openalex.org/keywords/stones-representation-theorem-for-boolean-algebras","display_name":"Stone's representation theorem for Boolean algebras","score":0.582005500793457},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5540251731872559},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.5493867993354797},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5455758571624756},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5335424542427063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.497653990983963},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.43653643131256104},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.42927491664886475},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4192773103713989},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.22101357579231262},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09236720204353333},{"id":"https://openalex.org/keywords/algebra-representation","display_name":"Algebra representation","score":0.04841390252113342}],"concepts":[{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.7458158731460571},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.6959654092788696},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6827945709228516},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.6654855012893677},{"id":"https://openalex.org/C81518389","wikidata":"https://www.wikidata.org/wiki/Q5156447","display_name":"Complete Boolean algebra","level":5,"score":0.631397008895874},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.6219490766525269},{"id":"https://openalex.org/C45503250","wikidata":"https://www.wikidata.org/wiki/Q4943350","display_name":"Boolean algebras canonically defined","level":5,"score":0.5833616852760315},{"id":"https://openalex.org/C10021369","wikidata":"https://www.wikidata.org/wiki/Q1166774","display_name":"Stone's representation theorem for Boolean algebras","level":5,"score":0.582005500793457},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5540251731872559},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.5493867993354797},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5455758571624756},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5335424542427063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.497653990983963},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.43653643131256104},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.42927491664886475},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4192773103713989},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.22101357579231262},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09236720204353333},{"id":"https://openalex.org/C14394260","wikidata":"https://www.wikidata.org/wiki/Q4723980","display_name":"Algebra representation","level":3,"score":0.04841390252113342}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ismvl.2004.1319949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ismvl.2004.1319949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 34th International Symposium on Multiple-Valued Logic","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.2832","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umb.edu/~dsim/papersps/bap.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W159269753","https://openalex.org/W1554822239","https://openalex.org/W1738410964","https://openalex.org/W1980985059","https://openalex.org/W2004737128","https://openalex.org/W2094060015","https://openalex.org/W2102229641","https://openalex.org/W2119390016","https://openalex.org/W2121616382","https://openalex.org/W2124565450","https://openalex.org/W2144614355","https://openalex.org/W2150272262","https://openalex.org/W2167054421","https://openalex.org/W2464276409"],"related_works":["https://openalex.org/W2150272262","https://openalex.org/W1499231756","https://openalex.org/W98542587","https://openalex.org/W4243283211","https://openalex.org/W3202105211","https://openalex.org/W2740171735","https://openalex.org/W2480828397","https://openalex.org/W1996189268","https://openalex.org/W2093024295","https://openalex.org/W2382077753"],"abstract_inverted_index":{"We":[0,16],"introduce":[1],"a":[2],"graph-theoretical":[3],"approach":[4],"to":[5,29,36],"the":[6],"study":[7,41],"of":[8,10,21,33],"approximation":[9],"non-Boolean":[11,22],"functions":[12,23,26,38],"on":[13],"Boolean":[14,25],"algebra.":[15],"show":[17],"that":[18],"optimal":[19],"interpolations":[20],"by":[24],"are":[27],"linked":[28],"minimal":[30],"chromatic":[31],"decompositions":[32],"graphs":[34],"attached":[35],"these":[37,45],"and":[39],"we":[40],"special":[42],"vertices":[43],"in":[44],"graphs.":[46]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}