{"id":"https://openalex.org/W139194355","doi":"https://doi.org/10.1007/978-3-642-23786-7_19","title":"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances","display_name":"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W139194355","doi":"https://doi.org/10.1007/978-3-642-23786-7_19","mag":"139194355"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-23786-7_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-23786-7_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5031401811","display_name":"Jessica Davies","orcid":"https://orcid.org/0000-0001-9832-7412"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jessica Davies","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, M5S 3H5"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, M5S 3H5","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079263019","display_name":"Fahiem Bacchus","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Fahiem Bacchus","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, M5S 3H5"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, M5S 3H5","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031401811"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":12.7169,"has_fulltext":false,"cited_by_count":138,"citation_normalized_percentile":{"value":0.9888819,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6966999769210815,"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.6966999769210815,"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.21439999341964722,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.009499999694526196,"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/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.912922739982605},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6739953756332397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6451541781425476},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.6244507431983948},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.615113377571106},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6052862405776978},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6043373346328735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4710930287837982},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.465424507856369},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33194759488105774},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3212655186653137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28587692975997925},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.15674051642417908},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11013710498809814}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.912922739982605},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6739953756332397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6451541781425476},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.6244507431983948},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.615113377571106},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6052862405776978},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6043373346328735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4710930287837982},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.465424507856369},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33194759488105774},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3212655186653137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28587692975997925},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.15674051642417908},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11013710498809814},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-23786-7_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-23786-7_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.6935","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.6935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~fbacchus/Papers/DB_CP2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W131311523","https://openalex.org/W153078869","https://openalex.org/W1531103278","https://openalex.org/W1556588790","https://openalex.org/W1578612406","https://openalex.org/W1775352280","https://openalex.org/W2027945171","https://openalex.org/W2108687116","https://openalex.org/W2118943303","https://openalex.org/W2171802366","https://openalex.org/W2336259629","https://openalex.org/W2611804663","https://openalex.org/W2731470751","https://openalex.org/W3038027991","https://openalex.org/W4230573295"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2480084299","https://openalex.org/W2394616262","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2408080066","https://openalex.org/W2406837904","https://openalex.org/W192406999","https://openalex.org/W2571882453","https://openalex.org/W4211028879"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}