{"id":"https://openalex.org/W2030408895","doi":"https://doi.org/10.1109/icmlc.2014.7009141","title":"Solving the maximum satisfiability problem by fuzzy converting it into a continuous optimization problem","display_name":"Solving the maximum satisfiability problem by fuzzy converting it into a continuous optimization problem","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2030408895","doi":"https://doi.org/10.1109/icmlc.2014.7009141","mag":"2030408895"},"language":"en","primary_location":{"id":"doi:10.1109/icmlc.2014.7009141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2014.7009141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Machine Learning and Cybernetics","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/A5034146966","display_name":"Lin\u2010Yu Tseng","orcid":"https://orcid.org/0000-0003-3704-3947"},"institutions":[{"id":"https://openalex.org/I177918364","display_name":"Providence University","ror":"https://ror.org/03fcpsq87","country_code":"TW","type":"education","lineage":["https://openalex.org/I177918364"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Lin-Yu Tseng","raw_affiliation_strings":["Department of Computer Science and Communication Engineering, Providence University, Taichung, Taiwan, ROC","Department of Computer Science and Communication Engineering, Providence University, 200, Sec. 7, Taiwan Boulevard, Taichung, Taiwan ROC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Communication Engineering, Providence University, Taichung, Taiwan, ROC","institution_ids":["https://openalex.org/I177918364"]},{"raw_affiliation_string":"Department of Computer Science and Communication Engineering, Providence University, 200, Sec. 7, Taiwan Boulevard, Taichung, Taiwan ROC","institution_ids":["https://openalex.org/I177918364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024197148","display_name":"Chun Chen","orcid":"https://orcid.org/0000-0002-7946-9957"},"institutions":[{"id":"https://openalex.org/I162838928","display_name":"National Chung Hsing University","ror":"https://ror.org/05vn3ca78","country_code":"TW","type":"education","lineage":["https://openalex.org/I162838928"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chun Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan, ROC","Department of Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, Taichung, Taiwan 402, ROC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan, ROC","institution_ids":["https://openalex.org/I162838928"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, Taichung, Taiwan 402, ROC","institution_ids":["https://openalex.org/I162838928"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08314634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"352","last_page":"358"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/satisfiability","display_name":"Satisfiability","score":0.665708601474762},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6289011836051941},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.62627774477005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5334041118621826},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.4895394742488861},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.47995832562446594},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4778837263584137},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.46093976497650146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36578935384750366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31515011191368103},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1479596197605133},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.11579987406730652},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.08924275636672974}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.665708601474762},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6289011836051941},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.62627774477005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5334041118621826},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.4895394742488861},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.47995832562446594},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4778837263584137},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.46093976497650146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36578935384750366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31515011191368103},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1479596197605133},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.11579987406730652},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.08924275636672974}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icmlc.2014.7009141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2014.7009141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Conference on Machine Learning and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W103980732","https://openalex.org/W127040706","https://openalex.org/W139325465","https://openalex.org/W1508459157","https://openalex.org/W1509570335","https://openalex.org/W1539750858","https://openalex.org/W1561035970","https://openalex.org/W1574977213","https://openalex.org/W1595159159","https://openalex.org/W1608439971","https://openalex.org/W1661761688","https://openalex.org/W1667614912","https://openalex.org/W1787020400","https://openalex.org/W1964878205","https://openalex.org/W1965992193","https://openalex.org/W1970320473","https://openalex.org/W1984164255","https://openalex.org/W1986446756","https://openalex.org/W1994210759","https://openalex.org/W2004660767","https://openalex.org/W2012313434","https://openalex.org/W2016245653","https://openalex.org/W2023923770","https://openalex.org/W2025399946","https://openalex.org/W2052115917","https://openalex.org/W2055710582","https://openalex.org/W2060265333","https://openalex.org/W2106440199","https://openalex.org/W2119266845","https://openalex.org/W2144027346","https://openalex.org/W2152195021","https://openalex.org/W2165372647","https://openalex.org/W2434254232","https://openalex.org/W4285719527","https://openalex.org/W6605191500","https://openalex.org/W6605704534","https://openalex.org/W6634465746","https://openalex.org/W6637229586","https://openalex.org/W6675949385","https://openalex.org/W6681052026","https://openalex.org/W6684615325","https://openalex.org/W6718718368"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W1913543287","https://openalex.org/W2336941104","https://openalex.org/W3120153087"],"abstract_inverted_index":{"The":[0,22,86],"satisfiability":[1,23,32,61],"problem":[2,6,24,33,62,72],"is":[3,25,34,55,73,111,146],"the":[4,16,30,59,69,76,92,97,102,117,127,130,139,143],"first":[5],"proved":[7],"to":[8,40,57,125],"be":[9],"NP-Complete":[10,18],"and":[11],"has":[12],"been":[13],"one":[14],"of":[15,129],"core":[17],"problems":[19],"since":[20],"then.":[21],"a":[26,51,64],"decision":[27],"problem.":[28,67],"And":[29],"maximum":[31,60],"its":[35],"optimization":[36,66,71],"version":[37],"that":[38,44,80,142],"aims":[39],"find":[41],"an":[42],"assignment":[43],"satisfies":[45],"most":[46],"clauses.":[47],"In":[48],"this":[49,107],"study,":[50],"fuzzy":[52,88],"conversion":[53,89],"method":[54,90,145],"proposed":[56,83,87,131,144],"convert":[58],"into":[63,96],"continuous":[65,70,98,108],"Then":[68],"solved":[74],"by":[75,84],"multiple":[77],"trajectory":[78],"search":[79,94,99,109,118],"was":[81,123],"previously":[82],"us.":[85],"transforms":[91],"discrete":[93],"space":[95,110],"space.":[100],"Furthermore,":[101],"fitness":[103],"function":[104],"defined":[105],"on":[106],"itself":[112],"continuous.":[113],"This":[114],"fact":[115],"makes":[116],"much":[119],"easier.":[120],"An":[121],"experiment":[122],"conducted":[124],"evaluate":[126],"performance":[128],"method.":[132],"Comparison":[133],"with":[134],"several":[135],"methods":[136],"published":[137],"in":[138],"literature":[140],"reveals":[141],"promising.":[147]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}