{"id":"https://openalex.org/W2118943303","doi":"https://doi.org/10.1007/978-3-642-02777-2_39","title":"Solving (Weighted) Partial MaxSAT through Satisfiability Testing","display_name":"Solving (Weighted) Partial MaxSAT through Satisfiability Testing","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2118943303","doi":"https://doi.org/10.1007/978-3-642-02777-2_39","mag":"2118943303"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02777-2_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02777-2_39","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/A5039752849","display_name":"Carlos Ans\u00f3tegui","orcid":"https://orcid.org/0000-0001-7727-2766"},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Carlos Ans\u00f3tegui","raw_affiliation_strings":["Universitat de Lleida (DIEI, UdL), Spain"],"affiliations":[{"raw_affiliation_string":"Universitat de Lleida (DIEI, UdL), Spain","institution_ids":["https://openalex.org/I15766328"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022258975","display_name":"Mar\u0131\u0301a Luisa Bonet","orcid":"https://orcid.org/0000-0003-1646-7177"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Mar\u00eda Luisa Bonet","raw_affiliation_strings":["Universitat Polit\u00e8cnica de Catalunya (LSI, UPC), Spain"],"affiliations":[{"raw_affiliation_string":"Universitat Polit\u00e8cnica de Catalunya (LSI, UPC), Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027212883","display_name":"Jordi Levy","orcid":"https://orcid.org/0009-0002-4337-2608"},"institutions":[{"id":"https://openalex.org/I4210131846","display_name":"Artificial Intelligence Research Institute","ror":"https://ror.org/03c0ach84","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210131846"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jordi Levy","raw_affiliation_strings":["Artificial Intelligence Research Institute (IIIA, CSIC), Spain"],"affiliations":[{"raw_affiliation_string":"Artificial Intelligence Research Institute (IIIA, CSIC), Spain","institution_ids":["https://openalex.org/I4210131846"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039752849"],"corresponding_institution_ids":["https://openalex.org/I15766328"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":12.7074,"has_fulltext":false,"cited_by_count":137,"citation_normalized_percentile":{"value":0.99319307,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"427","last_page":"440"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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.9988999962806702,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9702000021934509,"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.96670001745224,"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/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.9807760119438171},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8803430795669556},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7733743786811829},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7571583986282349},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7045552730560303},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6309589743614197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4751053750514984},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.4523514211177826},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4481182396411896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33506226539611816},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1216992437839508},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.07411089539527893}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.9807760119438171},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8803430795669556},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7733743786811829},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7571583986282349},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7045552730560303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6309589743614197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4751053750514984},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.4523514211177826},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4481182396411896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33506226539611816},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1216992437839508},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.07411089539527893}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-02777-2_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02777-2_39","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.157.9098","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.9098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iiia.csic.es/~levy/papers/SAT09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.472.2400","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.472.2400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iiia.csic.es/files/pdfs/SAT09published.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/W1509398350","https://openalex.org/W1524741427","https://openalex.org/W1531103278","https://openalex.org/W1535956448","https://openalex.org/W1539228153","https://openalex.org/W1559357575","https://openalex.org/W1568318479","https://openalex.org/W1603813317","https://openalex.org/W1604110421","https://openalex.org/W1678664543","https://openalex.org/W1776207179","https://openalex.org/W2098984274","https://openalex.org/W2100609826","https://openalex.org/W2128272523","https://openalex.org/W2140138589","https://openalex.org/W2476038305","https://openalex.org/W2486285674","https://openalex.org/W2487140311","https://openalex.org/W3150741540","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2394616262","https://openalex.org/W2480084299","https://openalex.org/W3152212242","https://openalex.org/W3107131366","https://openalex.org/W2014111643","https://openalex.org/W2408080066","https://openalex.org/W2406837904","https://openalex.org/W2571882453","https://openalex.org/W4211028879"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":17}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}