{"id":"https://openalex.org/W2077827857","doi":"https://doi.org/10.1145/1836089.1836098","title":"A declarative approach to robust weighted Max-SAT","display_name":"A declarative approach to robust weighted Max-SAT","publication_year":2010,"publication_date":"2010-07-26","ids":{"openalex":"https://openalex.org/W2077827857","doi":"https://doi.org/10.1145/1836089.1836098","mag":"2077827857"},"language":"en","primary_location":{"id":"doi:10.1145/1836089.1836098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1836089.1836098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming","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/A5038978960","display_name":"Miquel Bofill","orcid":"https://orcid.org/0000-0003-0308-9867"},"institutions":[{"id":"https://openalex.org/I251424209","display_name":"University of Girona","ror":"https://ror.org/01xdxns91","country_code":"ES","type":"education","lineage":["https://openalex.org/I251424209"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Miquel Bofill","raw_affiliation_strings":["Universitat de Girona, Girona, Spain"],"affiliations":[{"raw_affiliation_string":"Universitat de Girona, Girona, Spain","institution_ids":["https://openalex.org/I251424209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061078725","display_name":"D\u00eddac Busquets","orcid":"https://orcid.org/0000-0002-1381-0673"},"institutions":[{"id":"https://openalex.org/I251424209","display_name":"University of Girona","ror":"https://ror.org/01xdxns91","country_code":"ES","type":"education","lineage":["https://openalex.org/I251424209"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"D\u00eddac Busquets","raw_affiliation_strings":["Universitat de Girona, Girona, Spain"],"affiliations":[{"raw_affiliation_string":"Universitat de Girona, Girona, Spain","institution_ids":["https://openalex.org/I251424209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021854785","display_name":"Mateu Villaret","orcid":"https://orcid.org/0000-0002-8066-3458"},"institutions":[{"id":"https://openalex.org/I251424209","display_name":"University of Girona","ror":"https://ror.org/01xdxns91","country_code":"ES","type":"education","lineage":["https://openalex.org/I251424209"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Mateu Villaret","raw_affiliation_strings":["Universitat de Girona, Girona, Spain"],"affiliations":[{"raw_affiliation_string":"Universitat de Girona, Girona, Spain","institution_ids":["https://openalex.org/I251424209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038978960"],"corresponding_institution_ids":["https://openalex.org/I251424209"],"apc_list":null,"apc_paid":null,"fwci":1.8596,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86453451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"67","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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.9988999962806702,"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/T11182","display_name":"Auction Theory and Applications","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7709888815879822},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.7057745456695557},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6800570487976074},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.673300564289093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.636965274810791},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5884000062942505},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4957324266433716},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4701438248157501},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4622160792350769},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4528617560863495},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4520445466041565},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41285330057144165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.384966105222702},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2972119152545929},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1944950819015503},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.18144315481185913}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7709888815879822},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7057745456695557},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6800570487976074},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.673300564289093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.636965274810791},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5884000062942505},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4957324266433716},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4701438248157501},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4622160792350769},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4528617560863495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4520445466041565},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41285330057144165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.384966105222702},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2972119152545929},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1944950819015503},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.18144315481185913},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1836089.1836098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1836089.1836098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.703.9476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.703.9476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ima.udg.edu/%7Embofill/Site/Miquel_Bofills_Home_Page_files/bofill-ppdp10.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":21,"referenced_works":["https://openalex.org/W153078869","https://openalex.org/W1485965784","https://openalex.org/W1528279629","https://openalex.org/W1534604840","https://openalex.org/W1535326358","https://openalex.org/W1847027834","https://openalex.org/W1994152502","https://openalex.org/W2047442797","https://openalex.org/W2098248004","https://openalex.org/W2116758077","https://openalex.org/W2118578357","https://openalex.org/W2121957284","https://openalex.org/W2123032878","https://openalex.org/W2123936456","https://openalex.org/W2133057300","https://openalex.org/W2152294661","https://openalex.org/W2181620480","https://openalex.org/W2399519318","https://openalex.org/W2612690410","https://openalex.org/W3013782084","https://openalex.org/W4292896059"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1531664660","https://openalex.org/W4303044088","https://openalex.org/W2500041535","https://openalex.org/W1563755460","https://openalex.org/W1971069708","https://openalex.org/W2032348095","https://openalex.org/W2520084020","https://openalex.org/W1820477541"],"abstract_inverted_index":{"The":[0],"presence":[1],"of":[2,15,46,67,72,96,138],"uncertainty":[3],"in":[4,43,83,141],"the":[5,44,69,84,88,94,136,142],"real":[6],"world":[7],"makes":[8],"robustness":[9,57],"to":[10,17,61,77,113,132],"be":[11,30,118],"a":[12,23,128],"desired":[13],"property":[14],"solutions":[16,65,112],"constraint":[18],"satisfaction":[19],"prob-lems.":[20],"Roughly":[21],"speaking,":[22],"solution":[24],"is":[25],"robust":[26,111,143],"if":[27],"it":[28],"can":[29,117],"easily":[31],"repaired":[32],"when":[33],"unexpected":[34],"events":[35],"happen.":[36],"This":[37],"issue":[38],"has":[39],"already":[40],"been":[41],"addressed":[42],"frameworks":[45],"Boolean":[47],"satisfiability":[48],"(SAT)":[49],"and":[50,98,147],"Constraint":[51],"Programming":[52],"(CP).":[53],"Most":[54],"works":[55,92],"on":[56],"im-plement":[58],"search":[59],"algorithms":[60],"look":[62],"for":[63,101],"such":[64],"instead":[66],"tak-ing":[68],"declarative":[70],"approach":[71,131,140],"reformulation,":[73],"since":[74],"reformulation":[75,122],"tends":[76],"generate":[78],"prohibitively":[79],"large":[80],"formulas,":[81],"especially":[82],"CP":[85,103],"setting.":[86],"On":[87],"other":[89],"hand,":[90],"recent":[91],"suggest":[93],"use":[95,137],"SAT":[97],"Max-SAT":[99,115],"encodings":[100],"solving":[102],"instances.":[104],"In":[105],"this":[106],"paper":[107],"we":[108],"present":[109],"how":[110],"weighted":[114],"problems":[116],"effectively":[119],"obtained":[120],"via":[121],"into":[123],"pseudo-Boolean":[124],"formulae,":[125],"thus":[126],"providing":[127],"much":[129],"flexible":[130],"robustness.":[133],"We":[134],"illustrate":[135],"our":[139],"combinatorial":[144],"auctions":[145],"setting":[146],"provide":[148],"some":[149],"promising":[150],"experimental":[151],"results.":[152]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}