{"id":"https://openalex.org/W2042012783","doi":"https://doi.org/10.1145/1982185.1982382","title":"Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences","display_name":"Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences","publication_year":2011,"publication_date":"2011-03-21","ids":{"openalex":"https://openalex.org/W2042012783","doi":"https://doi.org/10.1145/1982185.1982382","mag":"2042012783"},"language":"en","primary_location":{"id":"doi:10.1145/1982185.1982382","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1982185.1982382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM Symposium on Applied Computing","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/A5014500892","display_name":"Emanuele Di Rosa","orcid":null},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Emanuele Di Rosa","raw_affiliation_strings":["University of Genoa, Genoa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Genoa, Genoa, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004609930","display_name":"Enrico Giunchiglia","orcid":"https://orcid.org/0000-0001-5758-2556"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Giunchiglia","raw_affiliation_strings":["University of Genoa, Genoa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Genoa, Genoa, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033998859","display_name":"Barry O\u2019Sullivan","orcid":"https://orcid.org/0000-0002-0090-2085"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Barry O'Sullivan","raw_affiliation_strings":["University College Cork, Cork, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5718,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58581739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"901","last_page":"906"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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.9994000196456909,"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.9973999857902527,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9961000084877014,"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/satisfiability","display_name":"Satisfiability","score":0.7710619568824768},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6796500086784363},{"id":"https://openalex.org/keywords/secretary-problem","display_name":"Secretary problem","score":0.5520857572555542},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5064796209335327},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.5024747848510742},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5019371509552002},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49527135491371155},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.4827091693878174},{"id":"https://openalex.org/keywords/stopping-rule","display_name":"Stopping rule","score":0.43864572048187256},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4375254213809967},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.41445255279541016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3987523317337036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3840416669845581},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.23367032408714294}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7710619568824768},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6796500086784363},{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.5520857572555542},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5064796209335327},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.5024747848510742},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5019371509552002},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49527135491371155},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.4827091693878174},{"id":"https://openalex.org/C2983961125","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping rule","level":2,"score":0.43864572048187256},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4375254213809967},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.41445255279541016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3987523317337036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3840416669845581},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.23367032408714294},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1982185.1982382","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1982185.1982382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM Symposium on Applied Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unige.it:11567/315989","is_oa":false,"landing_page_url":"http://hdl.handle.net/11567/315989","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4486072965","display_name":"Employing Artificial Intelligence to Make Constraint Programming Easier to Use for Decision Making","funder_award_id":"05/IN/I886","funder_id":"https://openalex.org/F4320320847","funder_display_name":"Science Foundation Ireland"}],"funders":[{"id":"https://openalex.org/F4320320847","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W179198942","https://openalex.org/W1482378289","https://openalex.org/W1518705996","https://openalex.org/W1561842830","https://openalex.org/W2042093992","https://openalex.org/W2051290144","https://openalex.org/W2051475155","https://openalex.org/W2084763084"],"related_works":["https://openalex.org/W3105682563","https://openalex.org/W2351073469","https://openalex.org/W2977579341","https://openalex.org/W3123602795","https://openalex.org/W2042777133","https://openalex.org/W2019629564","https://openalex.org/W2730931225","https://openalex.org/W4239532735","https://openalex.org/W2013038332","https://openalex.org/W2006698233"],"abstract_inverted_index":{"Satisfiability":[0,11],"problems":[1,105,205],"with":[2,84,106,213],"preferences":[3,20],"enrich":[4],"the":[5,9,16,59,71,76,100,129,132,151,160,163,167,173,178,183,191,195],"expressive":[6],"power":[7],"of":[8,18,49,61,115,131,144,169,182,190,194],"Boolean":[10],"problem":[12,78],"(SAT)":[13],"and":[14,148,206],"facilitate":[15],"representation":[17],"qualitative/quantitative":[19],"on":[21,58,122,134,159,202,208],"literals/formulas,":[22],"defining":[23],"an":[24,37,63,81,156],"optimization":[25],"problem.":[26],"In":[27,92],"some":[28],"cases,":[29],"it":[30,41,198],"is":[31,42,70,118,137,186,199],"not":[32],"strictly":[33],"necessary":[34],"to":[35,44,98],"compute":[36,45],"optimal":[38,64,72,82],"solution,":[39],"but":[40],"enough":[43],"a":[46,55,187],"sub-optimal":[47],"solution":[48,83],"high":[50],"quality":[51],"and,":[52,125],"possibly,":[53],"provide":[54],"lower":[56],"bound":[57],"probability":[60,85],"finding":[62],"solution.":[65],"The":[66],"1/e":[67,88],"-":[68],"rule":[69,74],"stopping":[73],"for":[75,102],"secretary":[77],"that":[79,110,128,143,177],"guarantees":[80],"at":[86],"least":[87],"can":[89],"be":[90],"found.":[91],"this":[93],"paper:":[94],"we":[95,108,126,149],"show":[96,109,127],"how":[97],"apply":[99],"1/e-rule":[101,133],"solving":[103],"satisfiability":[104],"preferences;":[107],"its":[111],"theoretical":[112,192],"success":[113,180],"rate":[114,181],"about":[116,200],"37%":[117],"greater":[119],"than":[120,142],"90%":[121],"random":[123],"benchmarks;":[124],"performance":[130],"structured":[135,204],"benchmarks":[136],"sometimes":[138],"many":[139],"orders-of-magnitude":[140],"worse":[141],"complete":[145],"search-based":[146],"algorithms,":[147],"explain":[150],"reasons":[152],"why.":[153],"We":[154],"propose":[155],"algorithm":[157,185],"based":[158],"idea":[161],"underlying":[162],"1/e-rule,":[164,196],"which":[165],"needs":[166],"generation":[168],"just":[170],"two":[171],"solutions:":[172],"experimental":[174],"evaluation":[175],"shows":[176],"average":[179],"proposed":[184],"good":[188],"approximation":[189],"one":[193],"since":[197],"50.92%":[201],"1956":[203],"48.33%":[207],"2400":[209],"randomly":[210],"generated":[211],"instances":[212],"200":[214],"variables.":[215]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}