{"id":"https://openalex.org/W2004200215","doi":"https://doi.org/10.1017/s147106840100134x","title":"Chain programs for writing deterministic metainterpreters","display_name":"Chain programs for writing deterministic metainterpreters","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W2004200215","doi":"https://doi.org/10.1017/s147106840100134x","mag":"2004200215"},"language":"en","primary_location":{"id":"doi:10.1017/s147106840100134x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840100134x","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-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/A5018103510","display_name":"David A. Rosenblueth","orcid":"https://orcid.org/0000-0001-8933-8267"},"institutions":[{"id":"https://openalex.org/I8961855","display_name":"Universidad Nacional Aut\u00f3noma de M\u00e9xico","ror":"https://ror.org/01tmp8f25","country_code":"MX","type":"education","lineage":["https://openalex.org/I8961855"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"DAVID A. ROSENBLUETH","raw_affiliation_strings":["Instituto de Investigaciones en Matem\u00e1ticas Aplicadas y en Sistemas, Universidad Nacional Aut\u00f3noma de M\u00e9xico, Apdo. 20-726, 01000 M\u00e9xico D.F","Instituto de Investigaciones en Matem\u00e1ticas Aplicadas y en Sistemas, Universidad Nacional Aut\u00f3noma de M\u00e9xico, Apdo. 20-726, 01000 M\u00e9xico D.F.#TAB#"],"affiliations":[{"raw_affiliation_string":"Instituto de Investigaciones en Matem\u00e1ticas Aplicadas y en Sistemas, Universidad Nacional Aut\u00f3noma de M\u00e9xico, Apdo. 20-726, 01000 M\u00e9xico D.F","institution_ids":["https://openalex.org/I8961855"]},{"raw_affiliation_string":"Instituto de Investigaciones en Matem\u00e1ticas Aplicadas y en Sistemas, Universidad Nacional Aut\u00f3noma de M\u00e9xico, Apdo. 20-726, 01000 M\u00e9xico D.F.#TAB#","institution_ids":["https://openalex.org/I8961855"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018103510"],"corresponding_institution_ids":["https://openalex.org/I8961855"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.11264614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"2","issue":"2","first_page":"203","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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/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/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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/computer-science","display_name":"Computer science","score":0.9024222493171692},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7421918511390686},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.6632854342460632},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6477681994438171},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.5212690830230713},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.4839511215686798},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4691064953804016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44848737120628357},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.42280134558677673}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9024222493171692},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7421918511390686},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.6632854342460632},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6477681994438171},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.5212690830230713},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.4839511215686798},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4691064953804016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44848737120628357},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.42280134558677673}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s147106840100134x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840100134x","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.7926","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.7926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cic2.iimas.unam.mx/~drosenbl/main.detmeta.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321143","display_name":"Indian Institute of Management Ahmedabad","ror":"https://ror.org/02egcpy68"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W6119768","https://openalex.org/W16194962","https://openalex.org/W17948677","https://openalex.org/W22089940","https://openalex.org/W31561947","https://openalex.org/W133676991","https://openalex.org/W156472946","https://openalex.org/W192201864","https://openalex.org/W426073433","https://openalex.org/W1497293019","https://openalex.org/W1502484951","https://openalex.org/W1514335004","https://openalex.org/W1514468887","https://openalex.org/W1522278016","https://openalex.org/W1529317038","https://openalex.org/W1531044637","https://openalex.org/W1540021488","https://openalex.org/W1548505684","https://openalex.org/W1550105278","https://openalex.org/W1578225692","https://openalex.org/W1578655107","https://openalex.org/W1597918680","https://openalex.org/W1608686192","https://openalex.org/W1985933047","https://openalex.org/W1988185893","https://openalex.org/W2025796387","https://openalex.org/W2033514658","https://openalex.org/W2051667248","https://openalex.org/W2059322630","https://openalex.org/W2071600844","https://openalex.org/W2085036403","https://openalex.org/W2110976851","https://openalex.org/W2113090411","https://openalex.org/W2172554482","https://openalex.org/W2173159284","https://openalex.org/W2911927583","https://openalex.org/W2912818154"],"related_works":["https://openalex.org/W2379153735","https://openalex.org/W2367630557","https://openalex.org/W101666983","https://openalex.org/W1987401065","https://openalex.org/W1516362967","https://openalex.org/W2137933774","https://openalex.org/W179542633","https://openalex.org/W2021515159","https://openalex.org/W2522304419","https://openalex.org/W2119952634"],"abstract_inverted_index":{"Many":[0],"metainterpreters":[1,80,118],"found":[2],"in":[3,10,102,121,162],"the":[4,11,14,24,86,92,97,103,185],"logic":[5,152],"programming":[6],"literature":[7],"are":[8,23,81],"nondeterministic":[9],"sense":[12],"that":[13,108,132],"selection":[15,47],"of":[16,48,57,70,76,94,96,99,123,178,184],"program":[17],"clauses":[18],"is":[19,35,50,110],"not":[20],"determined.":[21],"Examples":[22],"familiar":[25],"\u2018demo\u2019":[26],"and":[27,73,113,170],"\u2018vanilla\u2019":[28],"metainterpreters.":[29],"For":[30],"some":[31,38],"applications":[32,187],"this":[33],"nondeterminism":[34],"convenient.":[36],"In":[37],"cases,":[39],"however,":[40],"a":[41,100,128],"deterministic":[42],"metainterpreter,":[43],"having":[44],"an":[45],"explicit":[46],"clauses,":[49],"needed.":[51],"Such":[52],"cases":[53],"include":[54],"(1)":[55],"conversion":[56],"OR":[58],"parallelism":[59,62],"into":[60,127,154],"AND":[61],"for":[63,144,158,167,172],"\u2018committed-choice\u2019":[64],"processors,":[65],"(2)":[66],"logic-based,":[67],"imperative-language":[68],"implementation":[69],"search":[71],"strategies,":[72],"(3)":[74],"simulation":[75],"bounded-resource":[77],"reasoning.":[78],"Deterministic":[79],"difficult":[82],"to":[83,115],"write":[84,116],"because":[85],"programmer":[87],"must":[88],"be":[89],"concerned":[90],"about":[91,141],"set":[93],"unifiers":[95],"children":[98],"node":[101],"derivation":[104],"tree.":[105],"We":[106,147],"argue":[107],"it":[109],"both":[111],"possible":[112],"advantageous":[114],"these":[117],"by":[119],"reasoning":[120],"terms":[122],"object":[124],"programs":[125,153,160],"converted":[126],"syntactically":[129],"restricted":[130],"form":[131],"we":[133,138,181],"call":[134],"\u2018chain\u2019":[135],"form,":[136,156],"where":[137],"can":[139],"forget":[140],"unification,":[142],"except":[143],"unit":[145],"clauses.":[146],"give":[148],"two":[149,163],"transformations":[150],"converting":[151],"chain":[155],"one":[157,171],"\u2018moded\u2019":[159],"(implicit":[161],"existing":[164],"exhaustive-traversal":[165],"methods":[166],"committed-choice":[168],"execution),":[169],"arbitrary":[173],"definite":[174],"programs.":[175],"As":[176],"illustrations":[177],"our":[179],"approach":[180],"show":[182],"examples":[183],"three":[186],"mentioned":[188],"above.":[189]},"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}