{"id":"https://openalex.org/W1967421825","doi":"https://doi.org/10.1016/s1571-0661(05)80635-8","title":"On the need for a different backtracking rule when dealing with late evaluation","display_name":"On the need for a different backtracking rule when dealing with late evaluation","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1967421825","doi":"https://doi.org/10.1016/s1571-0661(05)80635-8","mag":"1967421825"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80635-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80635-8","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80635-8","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088751356","display_name":"Marco Gavanelli","orcid":"https://orcid.org/0000-0001-7433-5899"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marco Gavanelli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071259603","display_name":"Michela Milano","orcid":"https://orcid.org/0000-0001-7379-1411"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michela Milano","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":0.4262,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72502721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"2","first_page":"145","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9940000176429749,"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.9940000176429749,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9836999773979187,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9829000234603882,"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/backtracking","display_name":"Backtracking","score":0.9753475785255432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6570507287979126},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6208797693252563},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6153659820556641},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5903661847114563},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.5751031041145325},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5725934505462646},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5612347722053528},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5553082823753357},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42090851068496704},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4140649437904358},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32743221521377563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3067985773086548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2627485394477844},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17598363757133484}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9753475785255432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6570507287979126},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6208797693252563},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6153659820556641},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5903661847114563},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.5751031041145325},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5725934505462646},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5612347722053528},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5553082823753357},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42090851068496704},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4140649437904358},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32743221521377563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3067985773086548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2627485394477844},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17598363757133484},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)80635-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80635-8","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80635-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80635-8","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","score":0.41999998688697815,"display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2495408185","https://openalex.org/W2017710358","https://openalex.org/W3122634451","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W6366331","https://openalex.org/W1486916474","https://openalex.org/W2141935412","https://openalex.org/W2097415053"],"abstract_inverted_index":{"Constraint":[0,13],"Satisfaction":[1],"Problems":[2],"(CSPs)":[3],"represent":[4],"a":[5,37,122,140,144],"widely":[6,106],"used":[7,74],"framework":[8],"for":[9,22,44,126],"many":[10],"real-life":[11],"problems.":[12],"Logic":[14],"Programming":[15],"(CLP)":[16],"languages":[17],"are":[18,87],"an":[19],"effective":[20,43],"tool":[21],"modeling":[23],"problems":[24],"in":[25,61,75,81,108,135],"terms":[26],"of":[27,50,53,69,99,143],"CSPs":[28],"and":[29,129,137],"solving":[30,38,45],"them":[31],"efficiently.":[32],"Lazy":[33],"domain":[34,59,133],"evaluation":[35,60,134],"is":[36,63],"technique":[39],"that":[40],"has":[41],"proven":[42],"CSPs,":[46],"allowing":[47],"the":[48,51,70,84,97,100,109,114,147],"minimization":[49],"number":[52],"constraint":[54],"checks.":[55],"However,":[56],"exploiting":[57],"lazy":[58,132],"CLP":[62],"not":[64,112],"very":[65],"effective,":[66],"mainly":[67],"because":[68],"chronological":[71],"backtracking":[72,79,104,123],"rule":[73,105,124],"CLP.":[76],"After":[77],"each":[78],"step,":[80],"fact,":[82],"all":[83],"obtained":[85],"results":[86],"lost,":[88],"even":[89],"if":[90],"they":[91],"had":[92],"nothing":[93],"to":[94],"do":[95],"with":[96,131],"culprit":[98],"failure.":[101],"The":[102],"intelligent":[103],"studied":[107],"past":[110],"does":[111],"solve":[113],"problem":[115],"either.":[116],"In":[117],"this":[118],"paper,":[119],"we":[120,138],"propose":[121],"useful":[125],"dealing":[127],"efficiently":[128],"declaratively":[130],"CLP,":[136],"show":[139],"simple":[141],"implementation":[142],"metainterpreter":[145],"providing":[146],"depicted":[148],"functionality.":[149]},"counts_by_year":[],"updated_date":"2026-06-20T20:08:15.867695","created_date":"2025-10-10T00:00:00"}