{"id":"https://openalex.org/W2158912352","doi":"https://doi.org/10.1007/3-540-60983-0_1","title":"Semantics of constraint logic programs with bounded quantifiers","display_name":"Semantics of constraint logic programs with bounded quantifiers","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2158912352","doi":"https://doi.org/10.1007/3-540-60983-0_1","mag":"2158912352"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-60983-0_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60983-0_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5016291896","display_name":"Martin Argenius","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":"Martin Argenius","raw_affiliation_strings":["Computing Science Department, Uppsala University, Box 311, S 751 05, Sweden"],"affiliations":[{"raw_affiliation_string":"Computing Science Department, Uppsala University, Box 311, S 751 05, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054629753","display_name":"\u0410\u043d\u0434\u0440\u0435\u0439 \u0412\u043e\u0440\u043e\u043d\u043a\u043e\u0432","orcid":"https://orcid.org/0009-0009-4367-4885"},"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":false,"raw_author_name":"Andrei Voronkov","raw_affiliation_strings":["Computing Science Department, Uppsala University, Box 311, S 751 05, Sweden"],"affiliations":[{"raw_affiliation_string":"Computing Science Department, Uppsala University, Box 311, S 751 05, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016291896"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.435,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63522013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9991999864578247,"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.9991999864578247,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9958999752998352,"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/constraint-logic-programming","display_name":"Constraint logic programming","score":0.7502973079681396},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6615091562271118},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6409332752227783},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.6251426935195923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6178792715072632},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5475708842277527},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5209473371505737},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5114601850509644},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5106645226478577},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5064836740493774},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.49494093656539917},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4596419632434845},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.44341352581977844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4405773878097534},{"id":"https://openalex.org/keywords/stable-model-semantics","display_name":"Stable model semantics","score":0.42963361740112305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3356678783893585},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.2948814034461975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2870568633079529},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15402036905288696},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09311357140541077}],"concepts":[{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.7502973079681396},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6615091562271118},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6409332752227783},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.6251426935195923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6178792715072632},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5475708842277527},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5209473371505737},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5114601850509644},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5106645226478577},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5064836740493774},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.49494093656539917},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4596419632434845},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.44341352581977844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4405773878097534},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.42963361740112305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3356678783893585},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.2948814034461975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2870568633079529},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15402036905288696},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09311357140541077},{"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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-60983-0_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60983-0_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.6438","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.6438","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.csd.uu.se/pub/papers/masters-theses/0125-argenius.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.564","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.csd.uu.se/pub/papers/reports/0115.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/f140b96d-d6d1-4a94-bf35-21ed54da534a","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/f140b96d-d6d1-4a94-bf35-21ed54da534a","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Argenius, M, Voronkov, A, Dyckhoff, R (ed.), Herre, H (ed.) & Schroeder-Heister, P (ed.) 1996, Semantics of Constraint Logic Programs with Bounded Quantifiers. in R Dyckhoff, H Herre & P Schroeder-Heister (eds), ELP. vol. 1050, Lecture Notes in Computer Science, Springer Nature, pp. 1-18, Extensions of Logic Programming, 5th International Workshop, ELP'96, Leipzig, Germany, March 28-30, 1996, Proceedings, 1/01/24. https://doi.org/10.1007/3-540-60983-0_1","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/f140b96d-d6d1-4a94-bf35-21ed54da534a","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/rec/bibtex/conf/elp/ArgeniusV96","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Argenius, M, Voronkov, A, Dyckhoff, R (ed.), Herre, H (ed.) & Schroeder-Heister, P (ed.) 1996, Semantics of Constraint Logic Programs with Bounded Quantifiers. in R Dyckhoff, H Herre & P Schroeder-Heister (eds), ELP. vol. 1050, Lecture Notes in Computer Science, Springer Nature, pp. 1-18, Extensions of Logic Programming, 5th International Workshop, ELP'96, Leipzig, Germany, March 28-30, 1996, Proceedings, 1/01/24. https://doi.org/10.1007/3-540-60983-0_1","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2152806","https://openalex.org/W177649896","https://openalex.org/W288118142","https://openalex.org/W1485332185","https://openalex.org/W1766332311","https://openalex.org/W1987862681","https://openalex.org/W1988347771","https://openalex.org/W2029923610","https://openalex.org/W2030522691","https://openalex.org/W2056640187","https://openalex.org/W2063727779","https://openalex.org/W2084291619","https://openalex.org/W2109638425","https://openalex.org/W2142584035","https://openalex.org/W2158912352","https://openalex.org/W2180424213","https://openalex.org/W6600090297"],"related_works":["https://openalex.org/W1531664660","https://openalex.org/W1980681296","https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1548409801","https://openalex.org/W200657494","https://openalex.org/W1514298554","https://openalex.org/W1496100162","https://openalex.org/W2495969191","https://openalex.org/W1567852657"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-19T08:26:33.389920","created_date":"2025-10-10T00:00:00"}