{"id":"https://openalex.org/W2003164426","doi":"https://doi.org/10.1007/bf03037340","title":"Bounded quantifications for iteration and concurrency in logic programming","display_name":"Bounded quantifications for iteration and concurrency in logic programming","publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W2003164426","doi":"https://doi.org/10.1007/bf03037340","mag":"2003164426"},"language":"en","primary_location":{"id":"doi:10.1007/bf03037340","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf03037340","pdf_url":null,"source":{"id":"https://openalex.org/S165364243","display_name":"New Generation Computing","issn_l":"0288-3635","issn":["0288-3635","1882-7055"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"New Generation Computing","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/A5019225881","display_name":"Jonas Barklund","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Jonas Barklund","raw_affiliation_strings":["Computing Science Department, Uppsala University, Uppsala, Sweden","Computing Science Dept., Uppsala Univ., Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Computing Science Department, Uppsala University, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Computing Science Dept., Uppsala Univ., Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019225881"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":1.1295,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.81721859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"2","first_page":"161","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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":1.0,"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.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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.8396326303482056},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7273651957511902},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7107048034667969},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7092447280883789},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.7040143013000488},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.63899827003479},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.588881254196167},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5800953507423401},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5605902671813965},{"id":"https://openalex.org/keywords/repetition","display_name":"Repetition (rhetorical device)","score":0.5121190547943115},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4771392047405243},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.41155102849006653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14949563145637512}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8396326303482056},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7273651957511902},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7107048034667969},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7092447280883789},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.7040143013000488},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.63899827003479},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.588881254196167},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5800953507423401},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5605902671813965},{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.5121190547943115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4771392047405243},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.41155102849006653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14949563145637512},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf03037340","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf03037340","pdf_url":null,"source":{"id":"https://openalex.org/S165364243","display_name":"New Generation Computing","issn_l":"0288-3635","issn":["0288-3635","1882-7055"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"New Generation Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W2152806","https://openalex.org/W136416057","https://openalex.org/W288118142","https://openalex.org/W1504949952","https://openalex.org/W1513989732","https://openalex.org/W1530974209","https://openalex.org/W1541434994","https://openalex.org/W1543331534","https://openalex.org/W1544662935","https://openalex.org/W1581080230","https://openalex.org/W1582159526","https://openalex.org/W1584930493","https://openalex.org/W1585022015","https://openalex.org/W1585085979","https://openalex.org/W1590082923","https://openalex.org/W1603188321","https://openalex.org/W1604070206","https://openalex.org/W1607380961","https://openalex.org/W1983587324","https://openalex.org/W1985819576","https://openalex.org/W1993449345","https://openalex.org/W2043456428","https://openalex.org/W2046806568","https://openalex.org/W2051667248","https://openalex.org/W2062950667","https://openalex.org/W2064177750","https://openalex.org/W2081393155","https://openalex.org/W2125129987","https://openalex.org/W2144549834","https://openalex.org/W2180424213","https://openalex.org/W2490970523","https://openalex.org/W2752853835","https://openalex.org/W2796837256","https://openalex.org/W3004157836","https://openalex.org/W4206370914","https://openalex.org/W6600090297","https://openalex.org/W6601527583","https://openalex.org/W6605490968","https://openalex.org/W6607887978","https://openalex.org/W6631929662","https://openalex.org/W6632617217","https://openalex.org/W6634453026","https://openalex.org/W6635243171","https://openalex.org/W6685926746"],"related_works":["https://openalex.org/W1493824320","https://openalex.org/W2003151706","https://openalex.org/W50928870","https://openalex.org/W1542459781","https://openalex.org/W1977834309","https://openalex.org/W2741053223","https://openalex.org/W2097388634","https://openalex.org/W26136800","https://openalex.org/W1487563773","https://openalex.org/W1989482765"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}