{"id":"https://openalex.org/W2000220850","doi":"https://doi.org/10.1145/1069774.1069797","title":"Optimization with mode-directed preferences","display_name":"Optimization with mode-directed preferences","publication_year":2005,"publication_date":"2005-07-11","ids":{"openalex":"https://openalex.org/W2000220850","doi":"https://doi.org/10.1145/1069774.1069797","mag":"2000220850"},"language":"en","primary_location":{"id":"doi:10.1145/1069774.1069797","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1069774.1069797","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming","raw_type":"proceedings-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/A5075613260","display_name":"Hai-Feng Guo","orcid":"https://orcid.org/0000-0002-7558-8465"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hai-Feng Guo","raw_affiliation_strings":["University of Nebraska, Omaha, NE"],"affiliations":[{"raw_affiliation_string":"University of Nebraska, Omaha, NE","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103429521","display_name":"Bharat Jayaraman","orcid":"https://orcid.org/0000-0001-5646-3213"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bharat Jayaraman","raw_affiliation_strings":["State University of New York, Buffalo, NY"],"affiliations":[{"raw_affiliation_string":"State University of New York, Buffalo, NY","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067377863","display_name":"Gopal Gupta","orcid":"https://orcid.org/0000-0001-9727-0362"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gopal Gupta","raw_affiliation_strings":["University of Texas at Dallas, Richardson, TX","University of Texas at Dallas, Richardson, TX,"],"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Richardson, TX","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas, Richardson, TX,","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100348904","display_name":"Miao Liu","orcid":"https://orcid.org/0000-0002-6650-9972"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Miao Liu","raw_affiliation_strings":["University of Nebraska, Omaha, NE"],"affiliations":[{"raw_affiliation_string":"University of Nebraska, Omaha, NE","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075613260"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.8775,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79638122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"2001","issue":null,"first_page":"242","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"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.9986000061035156,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9962000250816345,"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.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.736034631729126},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.5302668809890747},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5135829448699951},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.46055567264556885},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.44389891624450684},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4401931166648865},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.43171894550323486},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42364269495010376},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39910197257995605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23456686735153198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18618419766426086},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.09317043423652649}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.736034631729126},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.5302668809890747},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5135829448699951},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.46055567264556885},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.44389891624450684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4401931166648865},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.43171894550323486},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42364269495010376},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39910197257995605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23456686735153198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18618419766426086},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.09317043423652649}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1069774.1069797","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1069774.1069797","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W5642659","https://openalex.org/W8723063","https://openalex.org/W31561947","https://openalex.org/W47323645","https://openalex.org/W77745623","https://openalex.org/W203717583","https://openalex.org/W243832903","https://openalex.org/W1541434994","https://openalex.org/W1585560305","https://openalex.org/W1589232796","https://openalex.org/W1763146822","https://openalex.org/W1972307965","https://openalex.org/W1986318362","https://openalex.org/W2021567838","https://openalex.org/W2029223741","https://openalex.org/W2049479585","https://openalex.org/W2063727779","https://openalex.org/W2065726785","https://openalex.org/W2070598037","https://openalex.org/W2096907043","https://openalex.org/W2108911687","https://openalex.org/W2145067417","https://openalex.org/W2155945137","https://openalex.org/W2161160885","https://openalex.org/W6609315415"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W1531664660","https://openalex.org/W1597500234","https://openalex.org/W1567852657","https://openalex.org/W2097415053","https://openalex.org/W1551947503","https://openalex.org/W1496100162","https://openalex.org/W2495969191","https://openalex.org/W242365536","https://openalex.org/W1559281853"],"abstract_inverted_index":{"Traditional":[0],"constraint":[1],"programming":[2],"specifies":[3],"an":[4,158,173],"optimization":[5,21,70,93,209],"problem":[6,169],"by":[7,34],"using":[8,183],"a":[9,35,64,83,139,191,220],"set":[10],"of":[11,147],"constraints":[12],"and":[13,75,95,123],"minimizing":[14],"(or":[15,38],"maximizing)":[16],"objective":[17,57],"functions.":[18,58],"Unfortunately,":[19],"general":[20],"problems":[22,71],"may":[23],"involve":[24],"compound":[25],"objectives":[26],"whose":[27],"optima":[28],"are":[29,213],"difficult":[30,53],"to":[31,54,137,163,171,215],"be":[32],"represented":[33],"simple":[36],"minimization":[37],"maximization).":[39],"Even":[40],"worse,":[41],"for":[42,67,88,99,103,129,207],"many":[43],"applications,":[44],"especially":[45],"those":[46],"defined":[47],"over":[48],"structural":[49],"domains,":[50],"it":[51],"is":[52,117,126,152,161,180],"specify":[55],"any":[56],"In":[59],"this":[60],"paper":[61,133],"we":[62],"presents":[63],"declarative":[65,221],"method":[66,81],"specifying":[68],"generalized":[69],"based":[72],"on":[73],"comparison":[74],"selection":[76,192],"among":[77,194],"alternative":[78,196],"solutions.":[79,107,197],"The":[80,145],"introduces":[82],"formal":[84],"predicate":[85],"mode":[86,188],"declaration":[87,189],"designating":[89],"certain":[90],"predicates":[91],"as":[92],"predicates,":[94],"uses":[96,111],"preference":[97],"rules":[98],"stating":[100],"the":[101,124,165,168,177,187,195,201,205],"criteria":[102],"determining":[104],"their":[105,110],"optimal":[106],"We":[108,198],"illustrate":[109],"with":[112,143,150],"two":[113,155],"representative":[114],"examples:":[115],"one":[116],"matrix-chain":[118],"multiplication":[119],"from":[120],"dynamic":[121],"programming,":[122],"other":[125],"ambiguity":[127],"resolution":[128],"recursively-defined":[130],"grammars.":[131],"This":[132],"also":[134],"addresses":[135],"how":[136],"extend":[138],"tabled":[140,184],"Prolog":[141],"system":[142],"preferences.":[144],"execution":[146],"logic":[148],"programs":[149],"preferences":[151,166,218],"achieved":[153],"in":[154],"steps.":[156],"First,":[157],"automatic":[159],"transformation":[160,202],"applied":[162],"embed":[164],"into":[167],"specification":[170],"form":[172],"executable":[174],"program.":[175],"Second,":[176],"new":[178],"program":[179],"then":[181],"evaluated":[182],"resolution,":[185],"while":[186],"provides":[190],"mechanism":[193],"show":[199],"that":[200,217],"scheme":[203],"preserves":[204],"semantics":[206],"each":[208],"predicate.":[210],"Experimental":[211],"results":[212],"shown":[214],"indicate":[216],"provide":[219],"approach":[222],"without":[223],"sacrificing":[224],"efficiency.":[225]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}