{"id":"https://openalex.org/W2294698107","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-103","title":"Read-once resolution for unsatisfiability-based Max-SAT algorithms","display_name":"Read-once resolution for unsatisfiability-based Max-SAT algorithms","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W2294698107","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-103","mag":"2294698107"},"language":"en","primary_location":{"id":"mag:2294698107","is_oa":false,"landing_page_url":"http://ijcai.org/papers11/Papers/IJCAI11-103.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null},"type":"conference-paper","indexed_in":[],"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/A5112009295","display_name":"Federico Heras","orcid":"https://orcid.org/0009-0002-9817-9792"},"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":"Federico Heras","raw_affiliation_strings":["University College Dublin, Dublin , Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University College Dublin, Dublin , Ireland","institution_ids":["https://openalex.org/I100930933"]}]},{"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":"Jo\u00e3o Marques\u2010Silva","raw_affiliation_strings":["University College Dublin, Dublin , Ireland"],"raw_orcid":"https://orcid.org/0000-0002-6632-3086","affiliations":[{"raw_affiliation_string":"University College Dublin, Dublin , Ireland","institution_ids":["https://openalex.org/I100930933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100930933"],"apc_list":null,"apc_paid":null,"fwci":1.1441,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.78639446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"572","last_page":"577"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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.9991000294685364,"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.9919000267982483,"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.9858999848365784,"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/resolution","display_name":"Resolution (logic)","score":0.8632683157920837},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.794602632522583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6362049579620361},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6238476037979126},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5515350699424744},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5374010801315308},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5365517139434814},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.45050951838493347},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4489625096321106},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.41179585456848145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26174092292785645},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23497772216796875}],"concepts":[{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.8632683157920837},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.794602632522583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6362049579620361},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6238476037979126},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5515350699424744},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5374010801315308},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5365517139434814},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.45050951838493347},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4489625096321106},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.41179585456848145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26174092292785645},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23497772216796875},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2294698107","is_oa":false,"landing_page_url":"http://ijcai.org/papers11/Papers/IJCAI11-103.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W180925943","https://openalex.org/W1492052509","https://openalex.org/W1506775176","https://openalex.org/W1531103278","https://openalex.org/W1562762628","https://openalex.org/W1578612406","https://openalex.org/W1775352280","https://openalex.org/W1988443389","https://openalex.org/W2027945171","https://openalex.org/W2098984274","https://openalex.org/W2118943303","https://openalex.org/W2121957284","https://openalex.org/W2137360584","https://openalex.org/W2140138589","https://openalex.org/W2154352023","https://openalex.org/W2159503942","https://openalex.org/W2171790376","https://openalex.org/W2171802366"],"related_works":["https://openalex.org/W3185606021","https://openalex.org/W2140138589","https://openalex.org/W299694663","https://openalex.org/W2594912772","https://openalex.org/W1492439953","https://openalex.org/W613961319","https://openalex.org/W1607919398","https://openalex.org/W217540047","https://openalex.org/W1518713730","https://openalex.org/W2187159007","https://openalex.org/W27762129","https://openalex.org/W2026630111","https://openalex.org/W1942651816","https://openalex.org/W2171033649","https://openalex.org/W2154352023","https://openalex.org/W1531103278","https://openalex.org/W1985863051","https://openalex.org/W3164530004","https://openalex.org/W1579248039","https://openalex.org/W1513397125"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"the":[3,6,19,31,54,72,107,114,117],"integration":[4],"of":[5,86,109,116],"resolution":[7,20,32,55,73,111],"rule":[8,21,74],"for":[9,22,75],"Max-SAT":[10,13,23,76,101],"with":[11,35],"unsatisfiability-based":[12,68],"solvers.":[14],"First,":[15],"we":[16,58,91],"show":[17,105],"that":[18,44,106],"can":[24,63],"be":[25,64],"safely":[26],"applied":[27,78],"as":[28],"dictated":[29],"by":[30],"proof":[33,41],"associated":[34],"an":[36,67,93],"unsatisfiable":[37],"core":[38],"when":[39],"such":[40],"is":[42,48,77],"read-once,":[43],"is,":[45],"each":[46],"clause":[47],"used":[49],"at":[50],"most":[51],"once":[52],"in":[53,66],"process.":[56],"Second,":[57],"study":[59],"how":[60],"this":[61],"property":[62],"integrated":[65],"solver.":[69,118],"In":[70],"particular,":[71],"to":[79,83],"read-once":[80,84,110],"proofs":[81],"or":[82],"subparts":[85],"a":[87],"general":[88],"proof.":[89],"Finally,":[90],"perform":[92],"empirical":[94],"investigation":[95],"on":[96],"structured":[97],"instances":[98],"from":[99],"recent":[100],"evaluations.":[102],"Preliminary":[103],"results":[104],"use":[108],"substantially":[112],"improves":[113],"performance":[115]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}