{"id":"https://openalex.org/W2883470031","doi":"https://doi.org/10.1109/access.2018.2855739","title":"A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting Tree","display_name":"A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting Tree","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2883470031","doi":"https://doi.org/10.1109/access.2018.2855739","mag":"2883470031"},"language":"en","primary_location":{"id":"doi:10.1109/access.2018.2855739","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2855739","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2018.2855739","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028290652","display_name":"Naiyu Tian","orcid":"https://orcid.org/0000-0003-3297-4718"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Naiyu Tian","raw_affiliation_strings":["Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I194450716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049462948","display_name":"Dantong Ouyang","orcid":"https://orcid.org/0000-0003-4504-1423"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dantong Ouyang","raw_affiliation_strings":["Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I194450716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110374086","display_name":"Fengyu Jia","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fengyu Jia","raw_affiliation_strings":["China Asset Management Co., Ltd., Beijing, China"],"affiliations":[{"raw_affiliation_string":"China Asset Management Co., Ltd., Beijing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101888103","display_name":"Meng Liu","orcid":"https://orcid.org/0000-0001-9517-1432"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Meng Liu","raw_affiliation_strings":["Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I194450716"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068082037","display_name":"Liming Zhang","orcid":"https://orcid.org/0000-0001-8263-4194"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liming Zhang","raw_affiliation_strings":["Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I194450716"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5028290652"],"corresponding_institution_ids":["https://openalex.org/I194450716"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08969507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"41042","last_page":"41049"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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/computer-science","display_name":"Computer science","score":0.7282443046569824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.707381010055542},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6093652248382568},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.55962735414505},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5271194577217102},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.481304794549942},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4738243818283081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23798435926437378}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7282443046569824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.707381010055542},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6093652248382568},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.55962735414505},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5271194577217102},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.481304794549942},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4738243818283081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23798435926437378},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":2,"locations":[{"id":"doi:10.1109/access.2018.2855739","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2855739","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ec60d70462194263a9a9cae71180280b","is_oa":true,"landing_page_url":"https://doaj.org/article/ec60d70462194263a9a9cae71180280b","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 6, Pp 41042-41049 (2018)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2018.2855739","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2855739","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1041616555","display_name":null,"funder_award_id":"61672261","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G1289623321","display_name":null,"funder_award_id":"61402196","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G2102830393","display_name":null,"funder_award_id":"61502199","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3964979808","display_name":null,"funder_award_id":"61373052","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W16743356","https://openalex.org/W124852706","https://openalex.org/W127232014","https://openalex.org/W179198942","https://openalex.org/W186301090","https://openalex.org/W380892905","https://openalex.org/W1513363711","https://openalex.org/W1515422723","https://openalex.org/W1542171562","https://openalex.org/W1565010992","https://openalex.org/W1567405466","https://openalex.org/W1576973534","https://openalex.org/W1603924993","https://openalex.org/W1607840088","https://openalex.org/W1686746446","https://openalex.org/W1913543287","https://openalex.org/W2024148935","https://openalex.org/W2036265926","https://openalex.org/W2037281185","https://openalex.org/W2062897452","https://openalex.org/W2066514569","https://openalex.org/W2096307462","https://openalex.org/W2114267503","https://openalex.org/W2134838216","https://openalex.org/W2144272791","https://openalex.org/W2164322797","https://openalex.org/W4251625379","https://openalex.org/W6600672943","https://openalex.org/W6605060499","https://openalex.org/W6607267866","https://openalex.org/W6607571975","https://openalex.org/W6612949654","https://openalex.org/W6632235947","https://openalex.org/W6634501213","https://openalex.org/W6636493399","https://openalex.org/W6637293339","https://openalex.org/W6639873981","https://openalex.org/W6674427772","https://openalex.org/W6679999538","https://openalex.org/W6683869205"],"related_works":["https://openalex.org/W2075768550","https://openalex.org/W3022218857","https://openalex.org/W2369178846","https://openalex.org/W2370289839","https://openalex.org/W2082716031","https://openalex.org/W2933494595","https://openalex.org/W4313347705","https://openalex.org/W2389214306","https://openalex.org/W1568049691","https://openalex.org/W2109315001"],"abstract_inverted_index":{"The":[0,25,41,71],"#SAT":[1],"problem,":[2],"which":[3,52],"is":[4,9,20,34,47,74,137,152,161,169],"also":[5],"called":[6],"model":[7,26,39,67],"counting,":[8],"one":[10],"of":[11,44,84,117,120,125,142,146,158],"the":[12,23,45,48,55,66,77,88,93,103,115,118,122,135,149,156,159,167],"most":[13],"important":[14],"problems":[15],"in":[16,130,140],"artificial":[17],"intelligence":[18],"and":[19,133,154,166],"challenging":[21],"to":[22,54,101],"researchers.":[24],"counting":[27,68],"based":[28,75],"on":[29,76,95,108],"extension":[30,78],"rule":[31],"(CER)":[32],"algorithm":[33,37,46,63,69,73,94,128,136,160],"an":[35,62],"exact":[36],"for":[38,86,163],"counting.":[40],"weak":[42],"point":[43],"high":[49],"computational":[50],"complexity":[51],"adds":[53],"running":[56,123],"time.":[57],"We":[58,80,91],"introduce":[59],"parallel":[60,127],"CER,":[61],"that":[64],"parallelizes":[65],"CER.":[70],"CER":[72],"rule.":[79],"propose":[81],"a":[82,96],"notion":[83],"MC-Tree":[85],"describing":[87],"computing":[89],"procedure.":[90],"implemented":[92],"quad-core":[97],"machine":[98],"using":[99,143],"OpenMP":[100],"measure":[102],"performance.":[104],"Our":[105],"experimental":[106],"results":[107],"simulated":[109],"data":[110],"show":[111],"that:":[112],"1)":[113],"with":[114],"increase":[116],"number":[119,145],"processors,":[121],"time":[124],"our":[126],"reduces":[129],"inverse":[131],"proportion,":[132],"furthermore,":[134],"more":[138],"efficient":[139],"case":[141],"each":[144],"processors":[147],"when":[148],"complementary":[150],"factor":[151],"higher":[153],"2)":[155],"scalability":[157],"linear":[162],"all":[164],"instances,":[165],"efficiency":[168],"evident.":[170]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2018-08-03T00:00:00"}