{"id":"https://openalex.org/W2017127498","doi":"https://doi.org/10.1016/s1571-0661(04)80784-9","title":"Demandness in Rewriting and Narrowing","display_name":"Demandness in Rewriting and Narrowing","publication_year":2002,"publication_date":"2002-11-01","ids":{"openalex":"https://openalex.org/W2017127498","doi":"https://doi.org/10.1016/s1571-0661(04)80784-9","mag":"2017127498"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80784-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80784-9","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066104807849/pdf","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://www.sciencedirect.com/science/article/pii/S1571066104807849/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012915644","display_name":"Sergio Antoy","orcid":"https://orcid.org/0000-0003-4522-7658"},"institutions":[{"id":"https://openalex.org/I126345244","display_name":"Portland State University","ror":"https://ror.org/00yn2fy02","country_code":"US","type":"education","lineage":["https://openalex.org/I126345244"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sergio Antoy","raw_affiliation_strings":["Computer Science Department, Portland State University, Portland OR 97207, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Portland State University, Portland OR 97207, U.S.A","institution_ids":["https://openalex.org/I126345244"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012146310","display_name":"Salvador Lucas","orcid":"https://orcid.org/0000-0001-9923-2108"},"institutions":[{"id":"https://openalex.org/I60053951","display_name":"Universitat Polit\u00e8cnica de Val\u00e8ncia","ror":"https://ror.org/01460j859","country_code":"ES","type":"education","lineage":["https://openalex.org/I60053951"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Salvador Lucas","raw_affiliation_strings":["Universidad Polit\u00e9cnica de Valencia, Spain","Universidad Politecnica de Valencia (Spain)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Polit\u00e9cnica de Valencia, Spain","institution_ids":["https://openalex.org/I60053951"]},{"raw_affiliation_string":"Universidad Politecnica de Valencia (Spain)#TAB#","institution_ids":["https://openalex.org/I60053951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012146310","https://openalex.org/A5012915644"],"corresponding_institution_ids":["https://openalex.org/I126345244","https://openalex.org/I60053951"],"apc_list":null,"apc_paid":null,"fwci":3.872,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.93395336,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"76","issue":null,"first_page":"42","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9991000294685364,"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":"Logic, programming, and type systems","score":0.9991000294685364,"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, Reasoning, and Knowledge","score":0.993399977684021,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9900000095367432,"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/rewriting","display_name":"Rewriting","score":0.9362912178039551},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.934048056602478},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7758203744888306},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.7399740219116211},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.624060869216919},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.48834916949272156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4261510968208313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3015606701374054},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2063167691230774}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.9362912178039551},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.934048056602478},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7758203744888306},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.7399740219116211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.624060869216919},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.48834916949272156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4261510968208313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3015606701374054},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2063167691230774},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s1571-0661(04)80784-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80784-9","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066104807849/pdf","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.6617","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.6617","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.pdx.edu/~antoy/homepage/./publications/wflp02/paper.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.6104","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.6104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dsic.upv.es/users/elp/berlanga/slucas/wflp02/wflp02.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80784-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80784-9","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066104807849/pdf","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":[],"awards":[{"id":"https://openalex.org/G4428759760","display_name":"ITR: Implementation of Functional Logic Languages","funder_award_id":"0218224","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G737420976","display_name":"U.S.-Germany Cooperative Research:  Advanced Techniques for Multi-Paradigm Declarative Languages","funder_award_id":"9981317","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8671094458","display_name":"ITR/SY: Non-Deterministic Computations for Functional Logic Programs","funder_award_id":"0110496","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321864","display_name":"Generalitat Valenciana","ror":"https://ror.org/0097mvx21"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2017127498.pdf","grobid_xml":"https://content.openalex.org/works/W2017127498.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W975212003","https://openalex.org/W1485652268","https://openalex.org/W1506492451","https://openalex.org/W1514390600","https://openalex.org/W1578902885","https://openalex.org/W1603716093","https://openalex.org/W1979197465","https://openalex.org/W1983937740","https://openalex.org/W1992085465","https://openalex.org/W2032825481","https://openalex.org/W2053719172","https://openalex.org/W2081230256","https://openalex.org/W2088747311","https://openalex.org/W2102574149","https://openalex.org/W2127455814","https://openalex.org/W2166060774","https://openalex.org/W2168144301","https://openalex.org/W2169402190","https://openalex.org/W2913954624","https://openalex.org/W6644915476","https://openalex.org/W6759445673"],"related_works":["https://openalex.org/W13634261","https://openalex.org/W2566257015","https://openalex.org/W56937029","https://openalex.org/W2963444893","https://openalex.org/W3163509751","https://openalex.org/W958050847","https://openalex.org/W2396405675","https://openalex.org/W175051304","https://openalex.org/W1548499332","https://openalex.org/W1549730417"],"abstract_inverted_index":{"The":[0,51],"traditional":[1],"investigation":[2],"of":[3,19,36,38,53,69,74,123,135,149,159],"rewriting":[4,29],"and":[5,27,30,61,81,100,128,154],"narrowing":[6,31],"strategies":[7,32,75,107,127],"aims":[8],"at":[9],"establishing":[10],"fundamental":[11,155],"properties,":[12],"such":[13],"as":[14,89],"soundness,":[15],"completeness":[16],"and/or":[17],"optimality,":[18],"a":[20,45,49,56,95],"strategy.":[21],"In":[22],"this":[23,93,111],"work,":[24,114],"we":[25,90],"analyze":[26],"compare":[28],"from":[33,138],"the":[34,39,67,121,133,147,157],"point":[35],"view":[37],"information":[40],"taken":[41],"into":[42,78],"account":[43,79],"by":[44,106],"strategy":[46,96,140],"to":[47,131,141,156],"compute":[48],"step.":[50],"notion":[52,148],"demandness":[54,150],"provides":[55],"suitable":[57],"framework":[58],"for":[59],"presenting":[60],"comparing":[62],"well-known":[63],"strategies.":[64,160],"We":[65,84],"find":[66],"existence":[68],"an":[70],"almost":[71],"linear":[72],"sequence":[73],"that":[76,146],"take":[77],"more":[80,82,98],"information.":[83],"show":[85],"on":[86,92],"examples":[87],"that,":[88],"progress":[91],"sequence,":[94],"becomes":[97],"focused":[99],"avoids":[101],"some":[102,136],"useless":[103],"steps":[104],"computed":[105],"preceding":[108],"it":[109,129],"in":[110,118],"sequence.":[112],"Our":[113],"which":[115],"is":[116,151],"still":[117],"progress,":[119],"clarifies":[120],"behavior":[122],"similar":[124],"or":[125],"related":[126],"promises":[130],"simplify":[132],"transfer":[134],"results":[137],"one":[139],"another.":[142],"It":[143],"also":[144],"suggest":[145],"both":[152],"atomic":[153],"study":[158]},"counts_by_year":[],"updated_date":"2026-08-02T14:50:37.381335","created_date":"2025-10-10T00:00:00"}