{"id":"https://openalex.org/W2137855809","doi":"https://doi.org/10.1109/hicss.1998.648306","title":"Approximate constraint satisfaction over a constraint hierarchy: a preliminary study","display_name":"Approximate constraint satisfaction over a constraint hierarchy: a preliminary study","publication_year":2002,"publication_date":"2002-11-27","ids":{"openalex":"https://openalex.org/W2137855809","doi":"https://doi.org/10.1109/hicss.1998.648306","mag":"2137855809"},"language":"en","primary_location":{"id":"doi:10.1109/hicss.1998.648306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hicss.1998.648306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First Hawaii International Conference on System Sciences","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/A5045009235","display_name":"Young U. Ryu","orcid":"https://orcid.org/0000-0002-4011-0170"},"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"]},{"id":"https://openalex.org/I4210133369","display_name":"Decision Sciences (United States)","ror":"https://ror.org/03gcvf773","country_code":"US","type":"company","lineage":["https://openalex.org/I4210133369"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Y.U. Ryu","raw_affiliation_strings":["Decision Sciences Department, University of Texas, Dallas, Richardson, TX, USA","Dept. of Decision Sci., Texas Univ., Dallas, TX, USA"],"affiliations":[{"raw_affiliation_string":"Decision Sciences Department, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319","https://openalex.org/I4210133369"]},{"raw_affiliation_string":"Dept. of Decision Sci., Texas Univ., Dallas, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045009235"],"corresponding_institution_ids":["https://openalex.org/I162577319","https://openalex.org/I4210133369"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.22151579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"5","issue":null,"first_page":"134","last_page":"141"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9848999977111816,"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/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.9175260066986084},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.871121883392334},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.8017116785049438},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7815399169921875},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6673877835273743},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.6124377846717834},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.597187876701355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.594417929649353},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5351620316505432},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.5178104639053345},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.48965054750442505},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.4667383134365082},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4498724341392517},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4432622194290161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44149264693260193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.433157742023468},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.4299566149711609},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4184274673461914},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19003507494926453},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.05706918239593506}],"concepts":[{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.9175260066986084},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.871121883392334},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.8017116785049438},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7815399169921875},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6673877835273743},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.6124377846717834},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.597187876701355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.594417929649353},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5351620316505432},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.5178104639053345},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.48965054750442505},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.4667383134365082},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4498724341392517},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4432622194290161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44149264693260193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.433157742023468},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.4299566149711609},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4184274673461914},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19003507494926453},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.05706918239593506},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hicss.1998.648306","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hicss.1998.648306","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-First Hawaii International Conference on System Sciences","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6899999976158142,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1513353427","https://openalex.org/W1972307965","https://openalex.org/W1978730176","https://openalex.org/W2096138715","https://openalex.org/W2135432705","https://openalex.org/W2289938059","https://openalex.org/W2317643564","https://openalex.org/W2318064754","https://openalex.org/W2913258176","https://openalex.org/W4233433191"],"related_works":["https://openalex.org/W2045729033","https://openalex.org/W4241669499","https://openalex.org/W2737098235","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2137855809","https://openalex.org/W2569549435","https://openalex.org/W2791406227","https://openalex.org/W1533609135","https://openalex.org/W2359974476"],"abstract_inverted_index":{"Given":[0],"a":[1,5,45,51,93,140],"problem":[2,49,94],"represented":[3],"as":[4],"set":[6],"of":[7,11,31,83,88,98,101,110,131,139,163],"constraints,":[8],"the":[9,20,29,66,73,81,86,96,99,129,152],"goal":[10],"constraint":[12,26,47,77,112,141,165],"satisfaction":[13,27,48,78,113,166],"is":[14,28,58],"to":[15,60,150],"find":[16],"solutions":[17,34,84,90],"that":[18],"satisfy":[19,42],"constraints.":[21,43],"A":[22],"necessary":[23],"requirement":[24],"for":[25,91],"discrimination":[30],"some":[32],"potential":[33,56,89,136,153],"from":[35],"others":[36],"by":[37,125],"investigating":[38],"how":[39],"well":[40],"they":[41],"Often,":[44],"practical":[46],"involves":[50],"situation":[52],"in":[53,95,128],"which":[54],"one":[55],"solution":[57],"evaluated":[59],"be":[61,115],"better":[62,71],"than":[63,72],"another":[64],"if":[65],"former":[67],"satisfies":[68],"constraints":[69,120,147],"significantly":[70,144],"latter":[74],"does.":[75],"Approximate":[76],"aims":[79],"at":[80],"selection":[82,130],"or":[85,104],"seriation":[87],"such":[92],"presence":[97],"notion":[100],"significant":[102],"difference":[103],"\"indifference":[105],"interval\".":[106],"The":[107],"underlying":[108],"idea":[109],"approximate":[111,164],"can":[114],"roughly":[116],"stated":[117],"that:":[118],"(1)":[119],"under":[121],"consideration":[122],"are":[123,142,148],"ordered":[124],"their":[126,169],"importance":[127],"solutions;":[132],"and":[133,167],"(2)":[134],"when":[135],"solutions'":[137],"satisfactions":[138],"not":[143],"different,":[145],"subsequent":[146],"used":[149],"discriminate":[151],"solutions.":[154],"Based":[155],"on":[156],"this":[157],"idea,":[158],"we":[159],"propose":[160],"two":[161],"methods":[162],"discuss":[168],"properties.":[170]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}