乐胖代购免代理版

{"id":"https://openalex.org/W2067918506","doi":"https://doi.org/10.1142/s021821301250025x","title":"HYBRID INCREMENTAL ALGORITHMS FOR BOOLEAN SATISFIABILITY","display_name":"HYBRID INCREMENTAL ALGORITHMS FOR BOOLEAN SATISFIABILITY","publication_year":2012,"publication_date":"2012-05-04","ids":{"openalex":"https://openalex.org/W2067918506","doi":"https://doi.org/10.1142/s021821301250025x","mag":"2067918506"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021821301250025x","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5054892568","display_name":"Florian Letombe","orcid":null},"institutions":[{"id":"https://openalex.org/I98172049","display_name":"Crocus Technology (France)","ror":"https://ror.org/016j33873","country_code":"FR","type":"company","lineage":["https://openalex.org/I98172049"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"FLORIAN LETOMBE","raw_affiliation_strings":["SpringSoft France, 6 place Robert Schuman, 38000 Grenoble, France"],"affiliations":[{"raw_affiliation_string":"SpringSoft France, 6 place Robert Schuman, 38000 Grenoble, France","institution_ids":["https://openalex.org/I98172049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002246957","display_name":"Jo\u00e3o Marques\u2010Silva","orcid":"https://orcid.org/0000-0002-6632-3086"},"institutions":[{"id":"https://openalex.org/I100930933","display_name":"University College Dublin","ror":"https://ror.org/05m7pjf47","country_code":"IE","type":"education","lineage":["https://openalex.org/I100930933"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"JOAO MARQUES-SILVA","raw_affiliation_strings":["CASL/CSI, University College Dublin (UCD), Dublin 4, Ireland"],"affiliations":[{"raw_affiliation_string":"CASL/CSI, University College Dublin (UCD), Dublin 4, Ireland","institution_ids":["https://openalex.org/I100930933"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.390382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":64,"max":72},"biblio":{"volume":"21","issue":"06","first_page":"1250025","last_page":"1250025"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9893,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9712,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.70837766},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6361986},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability Modulo Theories","score":0.6014916},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5368754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.839972},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.70837766},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6361986},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6014916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.57520145},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5368754},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5280581},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.47864664},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44958097},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.43482712},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41649765},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.39000544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12557364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.082555175},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021821301250025x","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.65,"display_name":"Peace, justice, and strong institutions","id":"https://metadata.un.org/sdg/16"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":27,"referenced_works":["https://openalex.org/W109784087","https://openalex.org/W139325465","https://openalex.org/W1494865762","https://openalex.org/W1495369628","https://openalex.org/W1496083386","https://openalex.org/W1517096625","https://openalex.org/W1518705996","https://openalex.org/W1591939288","https://openalex.org/W1606514674","https://openalex.org/W1667614912","https://openalex.org/W1787074469","https://openalex.org/W1978526866","https://openalex.org/W1988975685","https://openalex.org/W2024148935","https://openalex.org/W2045798132","https://openalex.org/W2057361103","https://openalex.org/W2060265333","https://openalex.org/W2062897452","https://openalex.org/W2073472614","https://openalex.org/W2075959177","https://openalex.org/W2108637261","https://openalex.org/W2118154221","https://openalex.org/W2119190805","https://openalex.org/W2131367934","https://openalex.org/W2141037672","https://openalex.org/W2151398141","https://openalex.org/W2165372647"],"related_works":["https://openalex.org/W4240446120","https://openalex.org/W3173322326","https://openalex.org/W3152212242","https://openalex.org/W3136261533","https://openalex.org/W2408080066","https://openalex.org/W2406837904","https://openalex.org/W2394616262","https://openalex.org/W2332241156","https://openalex.org/W2127594621","https://openalex.org/W2014111643"],"abstract_inverted_index":{"Boolean":[0],"Satisfiability":[1,42],"(SAT)":[2],"solvers":[3,30],"have":[4],"been":[5],"successfully":[6],"applied":[7],"to":[8,90],"a":[9,86],"wide":[10],"range":[11],"of":[12,36,50,52,64,88],"practical":[13],"applications,":[14],"including":[15,41],"hardware":[16],"model":[17,20],"checking,":[18,23],"software":[19],"finding,":[21],"equivalence":[22],"and":[24,60,79],"planning,":[25],"among":[26],"many":[27],"others.":[28],"SAT":[29,53,81,92],"are":[31,101,113],"also":[32],"the":[33,62,98],"building":[34],"block":[35],"more":[37,56,65,111,115],"sophisticated":[38],"decision":[39],"procedures,":[40],"Modulo":[43],"Theory":[44],"(SMT)":[45],"solvers.":[46,82,93],"The":[47,103],"large":[48],"number":[49,87],"applications":[51],"yields":[54],"ever":[55],"challenging":[57],"problem":[58],"instances,":[59],"motivate":[61],"development":[63],"efficient":[66],"algorithms.":[67],"Recent":[68],"work":[69],"studied":[70],"hybrid":[71,91],"approaches":[72],"for":[73],"SAT,":[74],"which":[75],"involves":[76],"integrating":[77],"incomplete":[78],"complete":[80],"This":[83],"paper":[84],"proposes":[85],"improvements":[89],"Experimental":[94],"results":[95],"demonstrate":[96],"that":[97],"proposed":[99],"optimizations":[100],"effective.":[102],"resulting":[104],"algorithms":[105],"in":[106],"general":[107],"perform":[108],"better":[109],"and,":[110],"importantly,":[112],"significantly":[114],"robust.":[116]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2067918506","counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2024-12-12T21:30:13.089833","created_date":"2016-06-24"}