{"id":"https://openalex.org/W1990338513","doi":"https://doi.org/10.1145/1085099.1085105","title":"Designing an efficient computation strategy in CFLP(FD) using definitional trees","display_name":"Designing an efficient computation strategy in CFLP(FD) using definitional trees","publication_year":2005,"publication_date":"2005-09-29","ids":{"openalex":"https://openalex.org/W1990338513","doi":"https://doi.org/10.1145/1085099.1085105","mag":"1990338513"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/1085099.1085105","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5063095862","display_name":"Sonia Est\u00e9vez Mart\u00edn","orcid":null},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Sonia Est\u00e9vez Mart\u00edn","raw_affiliation_string":"Universidad Complutense de Madrid, SPAIN","raw_affiliation_strings":["Universidad Complutense de Madrid, SPAIN"]},{"author_position":"last","author":{"id":"https://openalex.org/A5019077673","display_name":"Rafael del Vado V\u00edrseda","orcid":"https://orcid.org/0000-0002-1942-751X"},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Rafael del Vado V\u00edrseda","raw_affiliation_string":"Universidad Complutense de Madrid, SPAIN","raw_affiliation_strings":["Universidad Complutense de Madrid, SPAIN"]}],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"cited_by_percentile_year":{"min":76,"max":78},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Program Analysis and Verification Techniques","score":0.9992,"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/T10126","display_name":"Program Analysis and Verification Techniques","score":0.9992,"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/T11010","display_name":"Logic Programming and Knowledge Representation","score":0.9986,"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/T10142","display_name":"Formal Methods in Software Verification and Control","score":0.9972,"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":[{"keyword":"efficient computation strategy","score":0.5537},{"keyword":"definitional trees","score":0.5159}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6932513},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.62468153},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5107105},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5061521},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.49919534},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.4641771},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45919856},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.4561526},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.45547107},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.44665194},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44293886},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.41496253},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.41067874},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.306859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25312126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25281867},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.20402667},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08009967},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/1085099.1085105","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"referenced_works_count":13,"referenced_works":["https://openalex.org/W195049488","https://openalex.org/W1563777180","https://openalex.org/W1814221162","https://openalex.org/W1992085465","https://openalex.org/W2013131987","https://openalex.org/W2017122484","https://openalex.org/W2038909941","https://openalex.org/W2040905023","https://openalex.org/W2059799630","https://openalex.org/W2063727779","https://openalex.org/W2113740617","https://openalex.org/W2116940213","https://openalex.org/W2169402190"],"related_works":["https://openalex.org/W1810083572","https://openalex.org/W1481367841","https://openalex.org/W1498724794","https://openalex.org/W2018064910","https://openalex.org/W2561870262","https://openalex.org/W1584569710","https://openalex.org/W1493049790","https://openalex.org/W2525470665","https://openalex.org/W2156998935","https://openalex.org/W2275446441"],"ngrams_url":"https://api.openalex.org/works/W1990338513/ngrams","abstract_inverted_index":{"This":[0,95],"paper":[1],"proposes":[2],"the":[3,26,52,74,78,105,149,156,166],"integration":[4],"of":[5,21,25,54,104,151],"finite":[6],"domain":[7,44],"(FD)":[8],"constraints":[9],"into":[10],"a":[11,22,40,124,130],"general":[12],"purpose":[13],"lazy":[14,34],"functional":[15,92],"logic":[16,93],"programming":[17],"language":[18,51],"by":[19,64],"means":[20],"concrete":[23],"instance":[24],"generic":[27,106],"scheme":[28],"CFLP(D),":[29],"proposed":[30],"in":[31,48,69,91,113,136,155,170],"[19]":[32],"for":[33,59,62,82,133],"Constraint":[35],"Functional":[36],"Logic":[37],"Programming":[38],"over":[39],"parametrically":[41],"given":[42],"constraint":[43],"D.":[45],"We":[46],"sketch":[47],"this":[49,171],"CFLP(FD)":[50,157],"basis":[53],"an":[55,102,152],"efficient":[56,134],"computation":[57,75,97,175],"strategy":[58],"solving":[60],"goals":[61],"programs":[63],"using":[65],"definitional":[66],"trees":[67],"[1]":[68],"order":[70],"to":[71],"efficiently":[72],"control":[73],"and":[76,84,120,128,143],"maintain":[77],"good":[79],"properties":[80],"shown":[81],"needed":[83],"demand-driven":[85],"narrowing":[86],"strategies":[87],"[4,":[88],"15,":[89],"25]":[90],"programming.":[94],"convenient":[96],"mechanism":[98],"is":[99,163],"obtained":[100],"as":[101,140],"optimization":[103],"Constrained":[107],"Lazy":[108],"Narrowing":[109],"Calculus":[110],"CLNC(D)":[111],"presented":[112],"[20],":[114],"which":[115,162],"has":[116],"been":[117],"proved":[118],"sound":[119],"strongly":[121],"complete":[122],"w.r.t.":[123],"suitable":[125],"CFLP(D)":[126],"semantics,":[127],"provides":[129],"formal":[131],"foundation":[132],"implementations":[135],"existing":[137],"systems":[138],"such":[139],"Curry":[141],"[11]":[142],"TOY":[144],"[17].":[145],"Finally,":[146],"we":[147],"describe":[148],"execution":[150],"example":[153],"implemented":[154],"system":[158],"called":[159],"TOY(FD)":[160],"[9],":[161],"based":[164],"on":[165],"theoretical":[167],"ideas":[168],"introduced":[169],"paper,":[172],"following":[173],"our":[174],"strategy.":[176]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1990338513","counts_by_year":[],"updated_date":"2024-03-25T17:16:14.869409","created_date":"2016-06-24"}