{"id":"https://openalex.org/W7101144342","doi":null,"title":"Towards CSP Model Reformulation At Multiple Levels of Abstraction","display_name":"Towards CSP Model Reformulation At Multiple Levels of Abstraction","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7101144342"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.1154","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://4c.ucc.ie/web/upload/publications/inProc/fhmswreform02.ps","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7101144342"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5049086782","display_name":"Alan M. Frisch","orcid":"https://orcid.org/0000-0001-5015-2676","observed_orcids":["https://orcid.org/0000-0001-5015-2676"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan M. Frisch","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061867528","display_name":"Brahim Hnich","orcid":"https://orcid.org/0000-0001-8875-8390","observed_orcids":["https://orcid.org/0000-0001-8875-8390"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brahim Hnich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051169226","display_name":"Ian Miguel","orcid":"https://orcid.org/0000-0002-6930-2686","observed_orcids":["https://orcid.org/0000-0002-6930-2686"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ian Miguel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070515601","display_name":"Barbara M. Smith","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barbara M. Smith","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Toby Walsh","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toby Walsh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","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/T11596","display_name":"Constraint Satisfaction and Optimization","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/T10374","display_name":"Advanced Graph Theory Research","score":0.0003000000142492354,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.00019999999494757503,"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/constraint-satisfaction","display_name":"constraint satisfaction","score":0.9900000095367432},{"id":"https://openalex.org/keywords/model-reformulation","display_name":"model reformulation","score":0.9419999718666077},{"id":"https://openalex.org/keywords/levels-of-abstraction","display_name":"levels of abstraction","score":0.8690000176429749},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9710000157356262},{"id":"https://openalex.org/keywords/model-refinement","display_name":"model refinement","score":0.6460000276565552}],"concepts":[{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.8212000131607056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6575000286102295},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5810999870300293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5507000088691711},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5476999878883362},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5422999858856201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43540000915527344},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.36039999127388},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3116999864578247},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C147358964","wikidata":"https://www.wikidata.org/wiki/Q1200992","display_name":"Abstraction layer","level":3,"score":0.25369998812675476},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.1154","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://4c.ucc.ie/web/upload/publications/inProc/fhmswreform02.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2522455022","https://openalex.org/W3014350462","https://openalex.org/W308367170","https://openalex.org/W7096240643","https://openalex.org/W7097690718","https://openalex.org/W80684329","https://openalex.org/W4388926477","https://openalex.org/W144221159","https://openalex.org/W2147385902","https://openalex.org/W7099468798"],"abstract_inverted_index":{"Experts":[0],"at":[1,44,54,61,81,91,96,120],"modelling":[2],"constraint":[3],"satisfaction":[4],"problems":[5],"(CSPs)":[6],"carefully":[7],"choose":[8],"model":[9],"reformulations":[10,50],"to":[11,21,33,79,117,126,132,147],"reduce":[12],"greatly":[13],"the":[14,74,92,105],"amount":[15],"of":[16,47,77,84,94,123],"effort":[17],"that":[18,66],"is":[19,29,68,145],"required":[20],"solve":[22],"a":[23,30,71,133,140],"problem":[24,38],"by":[25],"systematic":[26],"search.":[27],"It":[28],"considerable":[31],"challenge":[32],"automate":[34],"such":[35,56],"reformulations.":[36],"A":[37],"may":[39,51],"be":[40,52,89,115],"viewed":[41],"and":[42,125],"reformulated":[43],"various":[45,121],"levels":[46,83,122],"abstraction.":[48,85],"Equivalent":[49],"simple":[53],"one":[55,130],"level,":[57],"yet":[58],"very":[59],"difficult":[60],"another.":[62],"Therefore":[63],"we":[64],"argue":[65],"it":[67],"essential":[69],"for":[70,73],"system":[72],"automatic":[75],"reformulation":[76],"CSPs":[78],"reason":[80],"multiple":[82],"Reformulations":[86],"can":[87],"then":[88],"made":[90],"level":[93,131],"abstraction":[95,124],"which":[97,108],"they":[98],"are":[99],"most":[100],"straightforward.":[101],"We":[102],"describe":[103],"how":[104],"CGRASS":[106],"system,":[107],"currently":[109],"reformulates":[110],"individual":[111],"CSP":[112],"instances,":[113],"could":[114],"augmented":[116],"reformulate":[118],"models":[119,128],"refine":[127],"from":[129],"less":[134],"abstract":[135],"level.":[136],"The":[137],"SONET":[138],"problem,":[139,144],"realistic":[141],"combinatorial":[142],"optimisation":[143],"used":[146],"illustrate":[148],"our":[149],"approach.":[150]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}