{"id":"https://openalex.org/W2160766833","doi":"https://doi.org/10.1017/s0269888901000017","title":"Combining linear programming and satisfiability solving for resource planning","display_name":"Combining linear programming and satisfiability solving for resource planning","publication_year":2001,"publication_date":"2001-03-01","ids":{"openalex":"https://openalex.org/W2160766833","doi":"https://doi.org/10.1017/s0269888901000017","mag":"2160766833"},"language":"en","primary_location":{"id":"doi:10.1017/s0269888901000017","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888901000017","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","raw_type":"journal-article"},"type":"article","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/A5037584244","display_name":"Steven A. Wolfman","orcid":"https://orcid.org/0000-0001-6323-8145"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"STEVEN A. WOLFMAN","raw_affiliation_strings":["Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u20132350","Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u2013\u20132350, USA wolf@cs.washington.edu"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u20132350","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u2013\u20132350, USA wolf@cs.washington.edu","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108370903","display_name":"Daniel S. Weld","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DANIEL S. WELD","raw_affiliation_strings":["Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u20132350","Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u2013\u20132350, USA weld@cs.washington.edu"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u20132350","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA 98195\u2013\u20132350, USA weld@cs.washington.edu","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037584244"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":7.0866,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96734524,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"1","first_page":"85","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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.9984999895095825,"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/satisfiability","display_name":"Satisfiability","score":0.759543240070343},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.616071343421936},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5918160676956177},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.524674117565155},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5020835399627686},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5010380744934082},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.47318196296691895},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.46633458137512207},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4641937017440796},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4500857889652252},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.43741464614868164},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.42899248003959656},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.41613519191741943},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32755550742149353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32100796699523926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3002414405345917},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29940980672836304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24469244480133057},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.15012773871421814}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.759543240070343},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.616071343421936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5918160676956177},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.524674117565155},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5020835399627686},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5010380744934082},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.47318196296691895},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.46633458137512207},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4641937017440796},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4500857889652252},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.43741464614868164},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.42899248003959656},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.41613519191741943},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32755550742149353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32100796699523926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3002414405345917},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29940980672836304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24469244480133057},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.15012773871421814},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0269888901000017","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0269888901000017","pdf_url":null,"source":{"id":"https://openalex.org/S137506714","display_name":"The Knowledge Engineering Review","issn_l":"0269-8889","issn":["0269-8889","1469-8005"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Knowledge Engineering Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.4975","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.4975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/wolf/papers/ker-lpsat.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.8291","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8291","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/weld/papers/ker-lpstat.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.9408","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.9408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.washington.edu/homes/wolf/papers/ker-lpsat.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.44999998807907104}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310358","display_name":"Achievement Rewards for College Scientists Foundation","ror":"https://ror.org/054awkm93"},{"id":"https://openalex.org/F4320322361","display_name":"Fondation ARC pour la Recherche sur le Cancer","ror":"https://ror.org/0489qz649"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W14839205","https://openalex.org/W30950413","https://openalex.org/W56814239","https://openalex.org/W91128990","https://openalex.org/W117707387","https://openalex.org/W1489779243","https://openalex.org/W1498154961","https://openalex.org/W1555515018","https://openalex.org/W1555936869","https://openalex.org/W1561608403","https://openalex.org/W1569757069","https://openalex.org/W1600919542","https://openalex.org/W1699282338","https://openalex.org/W1731763842","https://openalex.org/W2016321606","https://openalex.org/W2017127020","https://openalex.org/W2021519440","https://openalex.org/W2057361103","https://openalex.org/W2060498389","https://openalex.org/W2105479009","https://openalex.org/W2106397257","https://openalex.org/W2108637261","https://openalex.org/W2119190805","https://openalex.org/W2119710578","https://openalex.org/W2120647900","https://openalex.org/W2129591386","https://openalex.org/W2130660558","https://openalex.org/W2135591081","https://openalex.org/W2136950039","https://openalex.org/W2137271118","https://openalex.org/W2176876276","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3107131366","https://openalex.org/W2480084299","https://openalex.org/W1656268799","https://openalex.org/W2091617677","https://openalex.org/W2806052477","https://openalex.org/W2386111507","https://openalex.org/W2796388654","https://openalex.org/W1600869845","https://openalex.org/W2017695771","https://openalex.org/W4386297898"],"abstract_inverted_index":{"Compilation":[0],"to":[1,24,83,143],"Boolean":[2],"satisfiability":[3,25,109],"has":[4],"become":[5],"a":[6,119],"powerful":[7],"paradigm":[8],"for":[9,96,129],"solving":[10],"artificial":[11,43],"intelligence":[12,44],"problems.":[13],"However,":[14],"domains":[15],"that":[16,60,76,121],"require":[17],"metric":[18,65,123],"reasoning":[19],"cannot":[20],"be":[21],"compiled":[22],"efficiently":[23],"even":[26],"if":[27],"they":[28],"would":[29],"otherwise":[30],"benefit":[31],"from":[32,41,147],"compilation.":[33],"We":[34,67,92],"address":[35],"this":[36],"problem":[37],"by":[38,80,103,131],"combining":[39],"techniques":[40,95],"the":[42,53,105,108,134,138],"and":[45,100,110,150],"operations":[46],"research":[47],"communities.":[48],"In":[49],"particular,":[50],"we":[51,117],"introduce":[52],"LCNF":[54,78,128],"(Linear":[55,70],"Conjunctive":[56],"Normal":[57],"Form)":[58],"representation":[59],"combines":[61],"propositional":[62],"logic":[63],"with":[64,88],"constraints.":[66],"present":[68],"LPSAT":[69],"Programming":[71],"plus":[72],"SATisfiability),":[73],"an":[74,84],"engine":[75],"solves":[77],"problems":[79,126],"interleaving":[81],"calls":[82],"incremental":[85],"Simplex":[86],"algorithm":[87],"systematic":[89],"satisfaction":[90],"methods.":[91],"explore":[93],"several":[94,141],"enhancing":[97],"LPSAT's":[98],"efficiency":[99],"expressive":[101],"power":[102],"adjusting":[104],"interaction":[106],"between":[107],"linear":[111],"programming":[112],"components":[113],"of":[114,137],"LPSAT.":[115,132],"Next,":[116],"describe":[118],"compiler":[120],"converts":[122],"resource":[124],"planning":[125],"into":[127],"processing":[130],"Finally,":[133],"experimental":[135],"section":[136],"paper":[139],"explores":[140],"optimisations":[142],"LPSAT,":[144],"including":[145],"learning":[146],"constraint":[148],"failure":[149],"randomised":[151],"cutoffs.":[152]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}