{"id":"https://openalex.org/W2163348426","doi":"https://doi.org/10.3233/sat190036","title":"An Extended Semidefinite Relaxation for Satisfiability","display_name":"An Extended Semidefinite Relaxation for Satisfiability","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2163348426","doi":"https://doi.org/10.3233/sat190036","mag":"2163348426"},"language":"en","primary_location":{"id":"doi:10.3233/sat190036","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190036","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190036?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190036","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/sat190036?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190036","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005540131","display_name":"Miguel F. Anjos","orcid":"https://orcid.org/0000-0002-8258-9116"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Miguel F. Anjos","raw_affiliation_strings":["Department of Management Sciences, Faculty of Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. E-mail:\u00a0anjos@stanfordalumni.org"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, Faculty of Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. E-mail:\u00a0anjos@stanfordalumni.org","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005540131"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.17241933,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":"1","first_page":"15","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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.9990000128746033,"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.9951000213623047,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8089187145233154},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7926249504089355},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7582776546478271},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.6899722814559937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5787011384963989},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.512225329875946},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4593285918235779},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.413446843624115},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39806318283081055},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3681303858757019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31867581605911255},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.24069860577583313},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.09920185804367065},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06664606928825378}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8089187145233154},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7926249504089355},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7582776546478271},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.6899722814559937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5787011384963989},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.512225329875946},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4593285918235779},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.413446843624115},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39806318283081055},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3681303858757019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31867581605911255},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.24069860577583313},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.09920185804367065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06664606928825378},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3233/sat190036","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190036","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190036?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190036","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.104.5777","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.5777","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/addendum/ExtendedSDPforSAT.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.28","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.28","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/volume4/JSAT4_2_Anjos.pdf","raw_type":"text"},{"id":"pmh:oai:publications.polymtl.ca:38302","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/38302/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":{"id":"doi:10.3233/sat190036","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190036","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190036?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190036","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":[{"id":"https://openalex.org/G2165548363","display_name":null,"funder_award_id":"Canada","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G2862252062","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320321012","display_name":"Technische Universiteit Delft","ror":"https://ror.org/02e2c7k09"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2163348426.pdf","grobid_xml":"https://content.openalex.org/works/W2163348426.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W121484681","https://openalex.org/W157138717","https://openalex.org/W1505281405","https://openalex.org/W1505937274","https://openalex.org/W1518383689","https://openalex.org/W1532925583","https://openalex.org/W1540352354","https://openalex.org/W1558129180","https://openalex.org/W1562502650","https://openalex.org/W1627230931","https://openalex.org/W1893254807","https://openalex.org/W1965762037","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1970193303","https://openalex.org/W1974563688","https://openalex.org/W1985123706","https://openalex.org/W1989224068","https://openalex.org/W1997672673","https://openalex.org/W2009683816","https://openalex.org/W2018025029","https://openalex.org/W2023710022","https://openalex.org/W2026820987","https://openalex.org/W2031823362","https://openalex.org/W2035016254","https://openalex.org/W2046077540","https://openalex.org/W2046371296","https://openalex.org/W2049143039","https://openalex.org/W2050091725","https://openalex.org/W2057441901","https://openalex.org/W2072545857","https://openalex.org/W2074116126","https://openalex.org/W2078289947","https://openalex.org/W2089028944","https://openalex.org/W2092931458","https://openalex.org/W2098022011","https://openalex.org/W2106264302","https://openalex.org/W2133392939","https://openalex.org/W2133527541","https://openalex.org/W2136811867","https://openalex.org/W2137373403","https://openalex.org/W2163546623","https://openalex.org/W2210840110","https://openalex.org/W2323554188","https://openalex.org/W2495457432","https://openalex.org/W4245630182","https://openalex.org/W6629979159","https://openalex.org/W6636526798","https://openalex.org/W6644019265","https://openalex.org/W6723659458"],"related_works":["https://openalex.org/W2385886188","https://openalex.org/W2288891047","https://openalex.org/W2524928742","https://openalex.org/W2362452378","https://openalex.org/W2353517195","https://openalex.org/W3166939022","https://openalex.org/W1727084346","https://openalex.org/W2544939111","https://openalex.org/W2386048074","https://openalex.org/W2012205236"],"abstract_inverted_index":{"This":[0,12],"paper":[1],"proposes":[2],"a":[3,39,60,90],"new":[4],"semidefinite":[5,26,101],"programming":[6,102],"relaxation":[7,13,36,82,103],"for":[8,28,68,75,85],"the":[9,22,35,44,57,80,99],"satisfiability":[10],"problem.":[11],"is":[14,83,93,104],"an":[15],"extension":[16],"of":[17,24,34,41,43,62,78],"previous":[18],"relaxations":[19],"arising":[20],"from":[21],"paradigm":[23],"partial":[25],"liftings":[27],"0/1":[29],"optimization":[30],"problems.":[31],"The":[32],"construction":[33],"depends":[37],"on":[38],"choice":[40,77],"permutations":[42],"clauses,":[45],"and":[46,72,96],"different":[47,52],"choices":[48],"may":[49],"lead":[50],"to":[51,65],"relaxations.":[53],"We":[54],"then":[55],"consider":[56],"Tseitin":[58,91],"instances,":[59,87],"class":[61],"instances":[63],"known":[64],"be":[66],"hard":[67],"certain":[69],"proof":[70],"systems,":[71],"prove":[73],"that":[74,89],"any":[76],"permutations,":[79],"proposed":[81],"exact":[84],"these":[86],"meaning":[88],"instance":[92],"unsatisfiable":[94],"if":[95,98],"only":[97],"corresponding":[100],"infeasible.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}