{"id":"https://openalex.org/W2116758077","doi":"https://doi.org/10.3233/sat190014","title":"Translating Pseudo-Boolean Constraints into SAT","display_name":"Translating Pseudo-Boolean Constraints into SAT","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2116758077","doi":"https://doi.org/10.3233/sat190014","mag":"2116758077"},"language":"en","primary_location":{"id":"doi:10.3233/sat190014","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190014","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190014?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190014","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190014?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190014","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030158202","display_name":"Niklas E\u00e9n","orcid":null},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]},{"id":"https://openalex.org/I66217453","display_name":"Cadence Design Systems (United States)","ror":"https://ror.org/04w8xa018","country_code":"US","type":"company","lineage":["https://openalex.org/I66217453"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Niklas E\u00e9n","raw_affiliation_strings":["Cadence Berkeley Labs, Berkeley, USA. E-mail:\u00a0niklas@cadence.com"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cadence Berkeley Labs, Berkeley, USA. E-mail:\u00a0niklas@cadence.com","institution_ids":["https://openalex.org/I66217453","https://openalex.org/I148283060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053866278","display_name":"Niklas S\u00f6rensson","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Niklas S\u00f6rensson","raw_affiliation_strings":["Chalmers University of Technology, G\u00f6teborg, Sweden. E-mail:\u00a0nik@cs.chalmers.se"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, G\u00f6teborg, Sweden. E-mail:\u00a0nik@cs.chalmers.se","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030158202"],"corresponding_institution_ids":["https://openalex.org/I148283060","https://openalex.org/I66217453"],"apc_list":null,"apc_paid":null,"fwci":41.4625,"has_fulltext":false,"cited_by_count":579,"citation_normalized_percentile":{"value":0.9991159,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"2","issue":"1-4","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9979000091552734,"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.9944999814033508,"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/computer-science","display_name":"Computer science","score":0.44125115871429443},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4207039475440979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3549342453479767},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32500192523002625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28262853622436523},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.24311262369155884}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44125115871429443},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4207039475440979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3549342453479767},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32500192523002625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28262853622436523},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.24311262369155884}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3233/sat190014","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190014","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190014?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190014","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.109.4509","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.4509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jsat.ewi.tudelft.nl/content/volume2/JSAT2_1_Een.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.7386","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cadence.com/company/cadence_labs/niklas_jsat_2006_translating.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.182.1394","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.1394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://minisat.se/downloads/MiniSat%2B.pdf","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:74331","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/74331-translating-pseudo-boolean-constraints-into-sat","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:74331","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/74331","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.3233/sat190014","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190014","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190014?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190014","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2116758077.pdf"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W82625556","https://openalex.org/W978059555","https://openalex.org/W1494481937","https://openalex.org/W1518705996","https://openalex.org/W1540181924","https://openalex.org/W1550483759","https://openalex.org/W1568333198","https://openalex.org/W1576377586","https://openalex.org/W1999997889","https://openalex.org/W2033274122","https://openalex.org/W2080267935","https://openalex.org/W2095821893","https://openalex.org/W2097699872","https://openalex.org/W2100577981","https://openalex.org/W2100609826","https://openalex.org/W2103184499","https://openalex.org/W2109046513","https://openalex.org/W2114241070","https://openalex.org/W2133527541","https://openalex.org/W2134103145","https://openalex.org/W2135773785","https://openalex.org/W2138564201","https://openalex.org/W2141389982","https://openalex.org/W2142785340","https://openalex.org/W2144040805","https://openalex.org/W2145825841","https://openalex.org/W2147442986","https://openalex.org/W2160603870","https://openalex.org/W2165858176","https://openalex.org/W2752853835","https://openalex.org/W3198160809","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2118943303","https://openalex.org/W1979597421","https://openalex.org/W2301405299","https://openalex.org/W2952805501","https://openalex.org/W2007980826","https://openalex.org/W1775352280","https://openalex.org/W2498042365","https://openalex.org/W2909188079"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"describe":[4],"and":[5],"evaluate":[6],"three":[7],"different":[8],"techniques":[9],"for":[10],"translating":[11],"pseudo-boolean":[12],"constraints":[13,15],"(linear":[14],"over":[16],"boolean":[17],"variables)":[18],"into":[19],"clauses":[20],"that":[21,31],"can":[22],"be":[23],"handled":[24],"by":[25,32],"a":[26,34],"standard":[27],"SAT-solver.":[28],"We":[29],"show":[30],"applying":[33],"proper":[35],"mix":[36]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":33},{"year":2018,"cited_by_count":35},{"year":2017,"cited_by_count":34},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":33},{"year":2014,"cited_by_count":35},{"year":2013,"cited_by_count":41},{"year":2012,"cited_by_count":54}],"updated_date":"2026-05-22T09:01:20.584952","created_date":"2025-10-10T00:00:00"}