{"id":"https://openalex.org/W2156301254","doi":"https://doi.org/10.1109/iccl.1990.63777","title":"Lazy evaluation in logic programming","display_name":"Lazy evaluation in logic programming","publication_year":2002,"publication_date":"2002-12-04","ids":{"openalex":"https://openalex.org/W2156301254","doi":"https://doi.org/10.1109/iccl.1990.63777","mag":"2156301254"},"language":"en","primary_location":{"id":"doi:10.1109/iccl.1990.63777","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccl.1990.63777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 1990 International Conference on Computer Languages","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/A5056755374","display_name":"Sanjai Narain","orcid":"https://orcid.org/0000-0002-5535-1284"},"institutions":[{"id":"https://openalex.org/I1309849503","display_name":"RAND Corporation","ror":"https://ror.org/00f2z7n96","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1309849503"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Narain","raw_affiliation_strings":["RAND Corporation, Santa Monica, CA, USA"],"affiliations":[{"raw_affiliation_string":"RAND Corporation, Santa Monica, CA, USA","institution_ids":["https://openalex.org/I1309849503"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056755374"],"corresponding_institution_ids":["https://openalex.org/I1309849503"],"apc_list":null,"apc_paid":null,"fwci":1.2506,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8353636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"218","last_page":"227"},"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.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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 Verification","score":0.9965000152587891,"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/lazy-evaluation","display_name":"Lazy evaluation","score":0.8263455033302307},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.8218280076980591},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.806102454662323},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7956991195678711},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6951650381088257},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6777198314666748},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6477659940719604},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.47507041692733765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4597940146923065},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.4270709455013275},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.42510661482810974},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.3891719579696655}],"concepts":[{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.8263455033302307},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8218280076980591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.806102454662323},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7956991195678711},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6951650381088257},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6777198314666748},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6477659940719604},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.47507041692733765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4597940146923065},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.4270709455013275},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.42510661482810974},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.3891719579696655}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccl.1990.63777","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccl.1990.63777","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 1990 International Conference on Computer Languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W19647984","https://openalex.org/W100098737","https://openalex.org/W128107162","https://openalex.org/W159710003","https://openalex.org/W171707325","https://openalex.org/W196131355","https://openalex.org/W1535347731","https://openalex.org/W1556951601","https://openalex.org/W1559099005","https://openalex.org/W1584946103","https://openalex.org/W1607552714","https://openalex.org/W1698068146","https://openalex.org/W1975247475","https://openalex.org/W1979101142","https://openalex.org/W1983328110","https://openalex.org/W2008851176","https://openalex.org/W2010009487","https://openalex.org/W2017637575","https://openalex.org/W2025170645","https://openalex.org/W2030720224","https://openalex.org/W2036748304","https://openalex.org/W2063068243","https://openalex.org/W2075052434","https://openalex.org/W2092753191","https://openalex.org/W2105232714","https://openalex.org/W2115183492","https://openalex.org/W2126245009","https://openalex.org/W2158956202","https://openalex.org/W2165434002","https://openalex.org/W2295597695","https://openalex.org/W2515665553","https://openalex.org/W2913078623"],"related_works":["https://openalex.org/W2035762642","https://openalex.org/W1547392259","https://openalex.org/W2186849240","https://openalex.org/W778229461","https://openalex.org/W2090759054","https://openalex.org/W60003963","https://openalex.org/W4241924437","https://openalex.org/W3182911633","https://openalex.org/W1966091859","https://openalex.org/W2018501482"],"abstract_inverted_index":{"A":[0],"method":[1,90,114],"for":[2],"bringing":[3],"the":[4,32,44,51,98,117],"concept":[5],"of":[6,37,47,53,81,102,115,120,138,146],"lazy":[7,55,77,103,147],"evaluation":[8],"to":[9,97,122],"logic":[10],"programming":[11,137],"in":[12,68,134,143],"a":[13,54,65,85,112,123,128],"rigorous":[14],"yet":[15,131],"efficient":[16],"manner":[17],"is":[18,26,40,149],"presented.":[19],"Its":[20],"main":[21],"advantage":[22],"over":[23],"previous":[24],"methods":[25],"its":[27],"considerable":[28],"efficiency,":[29],"from":[30],"both":[31],"theoretical":[33],"and":[34,79,100],"implementation":[35,101,133],"points":[36],"view.":[38],"It":[39,62,105,110,126],"based":[41],"on":[42],"making":[43],"SLD-resolution":[45],"rule":[46],"inference":[48],"directly":[49],"simulate":[50],"behavior":[52],"rewriting":[56,148],"interpreter":[57],"satisfying":[58],"strong":[59],"computational":[60],"properties.":[61],"thereby":[63],"yields":[64],"powerful":[66],"system":[67],"which":[69],"one":[70],"can":[71,91],"program":[72],"with":[73],"functions,":[74],"relations,":[75],"non-determinism,":[76],"evaluation,":[78],"combinations":[80],"these":[82],"all":[83],"within":[84],"single":[86,124],"logical":[87],"framework.":[88],"The":[89],"also":[92],"be":[93],"viewed":[94],"as":[95],"contributing":[96],"design":[99],"rewriting.":[104,109],"introduces":[106],"lazy,":[107],"nondeterministic":[108],"proposes":[111],"new":[113],"shrinking":[116],"search":[118],"space":[119],"reductions":[121],"branch.":[125],"allows":[127],"very":[129],"simple,":[130],"efficient,":[132],"Prolog,":[135],"so":[136],"many":[139],"low-level":[140],"tasks":[141],"involved":[142],"usual":[144],"implementations":[145],"avoided":[150],"altogether.<":[151],"<ETX":[152],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[153],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">&gt;</ETX>":[154]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}