{"id":"https://openalex.org/W2058402932","doi":"https://doi.org/10.1016/s1571-0661(05)80121-5","title":"Defining Standard Prolog in Rewriting Logic","display_name":"Defining Standard Prolog in Rewriting Logic","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2058402932","doi":"https://doi.org/10.1016/s1571-0661(05)80121-5","mag":"2058402932"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80121-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80121-5","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)80121-5","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076181434","display_name":"Marija Kula\u0161","orcid":"https://orcid.org/0000-0001-5119-8596"},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M. Kula\u0161","raw_affiliation_strings":["FernUniversit\u00e4t Hagen, FB Informatik, D-58084 Hagen, Germany"],"affiliations":[{"raw_affiliation_string":"FernUniversit\u00e4t Hagen, FB Informatik, D-58084 Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002320735","display_name":"Christoph Beierle","orcid":"https://orcid.org/0000-0002-0736-8516"},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"C. Beierle","raw_affiliation_strings":["FernUniversit\u00e4t Hagen, FB Informatik, D-58084 Hagen, Germany"],"affiliations":[{"raw_affiliation_string":"FernUniversit\u00e4t Hagen, FB Informatik, D-58084 Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002320735","https://openalex.org/A5076181434"],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":0.5126,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76045646,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"36","issue":null,"first_page":"158","last_page":"174"},"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.9994000196456909,"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.9994000196456909,"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.9868000149726868,"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.9833999872207642,"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/prolog","display_name":"Prolog","score":0.8526235818862915},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.8227061033248901},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7992997169494629},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6796518564224243},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6410057544708252},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.5823813080787659},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.5625457167625427},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5375428199768066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4464433491230011},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.44107669591903687},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.41837966442108154},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4056204855442047}],"concepts":[{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.8526235818862915},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8227061033248901},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7992997169494629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6796518564224243},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6410057544708252},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.5823813080787659},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.5625457167625427},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5375428199768066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4464433491230011},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.44107669591903687},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.41837966442108154},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4056204855442047}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)80121-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80121-5","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)80121-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80121-5","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W35881770","https://openalex.org/W158887749","https://openalex.org/W165938396","https://openalex.org/W1479857163","https://openalex.org/W1506233153","https://openalex.org/W1536327987","https://openalex.org/W1579995533","https://openalex.org/W1596358429","https://openalex.org/W1973337882","https://openalex.org/W1976195354","https://openalex.org/W1985058553","https://openalex.org/W1987831438","https://openalex.org/W2009944560","https://openalex.org/W2015534329","https://openalex.org/W2063236708","https://openalex.org/W2072493788","https://openalex.org/W2131540458","https://openalex.org/W2143382644","https://openalex.org/W2149677005","https://openalex.org/W2276327683","https://openalex.org/W2554538999","https://openalex.org/W2914693551","https://openalex.org/W3195862117","https://openalex.org/W4230977899","https://openalex.org/W4285719527","https://openalex.org/W6601492723","https://openalex.org/W6606442424","https://openalex.org/W6606678960","https://openalex.org/W6630122838"],"related_works":["https://openalex.org/W4251667305","https://openalex.org/W2356927372","https://openalex.org/W4287686397","https://openalex.org/W3080447568","https://openalex.org/W4378501577","https://openalex.org/W1544967197","https://openalex.org/W4386138535","https://openalex.org/W2148369462","https://openalex.org/W2128874347","https://openalex.org/W1558467648"],"abstract_inverted_index":{"The":[0,33,81],"coincidence":[1],"between":[2],"the":[3,6,41,54,66,75],"model-theoretic":[4],"and":[5,26,79],"procedural":[7],"semantics":[8,49],"of":[9,35,44,50,56,65,77,99],"SLD-resolution":[10],"does":[11],"not":[12],"carry":[13],"over":[14],"to":[15,39],"a":[16,45,61,91],"Prolog":[17,52,67],"system":[18,83],"that":[19],"also":[20],"implements":[21],"non-logical":[22],"features":[23],"like":[24],"cut":[25],"whose":[27],"depth-first":[28],"search":[29],"strategy":[30],"is":[31,38,72],"incomplete.":[32],"purpose":[34],"this":[36],"paper":[37],"present":[40],"key":[42],"concepts":[43],"new,":[46],"simple":[47],"operational":[48],"Standard":[51],"in":[53,90],"form":[55],"rewriting":[57,82,92],"rules.":[58],"We":[59],"use":[60],"novel":[62],"linear":[63],"representation":[64],"tree":[68],"traversal.":[69],"A":[70],"derivation":[71],"represented":[73],"at":[74],"level":[76],"unification":[78],"backtracking.":[80],"presented":[84],"here":[85],"can":[86],"easily":[87],"be":[88],"implemented":[89],"logic":[93],"language,":[94],"giving":[95],"an":[96],"executable":[97],"specification":[98],"Prolog.":[100]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}