{"id":"https://openalex.org/W2071906443","doi":"https://doi.org/10.1016/s1571-0661(04)80795-3","title":"Set-based Nondeterministic Declarative Programming in Singleton","display_name":"Set-based Nondeterministic Declarative Programming in Singleton","publication_year":2002,"publication_date":"2002-11-01","ids":{"openalex":"https://openalex.org/W2071906443","doi":"https://doi.org/10.1016/s1571-0661(04)80795-3","mag":"2071906443"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80795-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80795-3","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(04)80795-3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062894556","display_name":"Gianfranco Rossi","orcid":"https://orcid.org/0000-0002-6970-8790"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Gianfranco Rossi","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Parma, 43100 Parma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Parma, 43100 Parma, Italy","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062894556"],"corresponding_institution_ids":["https://openalex.org/I124601658"],"apc_list":null,"apc_paid":null,"fwci":0.4301,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68943971,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"76","issue":null,"first_page":"216","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.9995999932289124,"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.9995999932289124,"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.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/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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.7950043678283691},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7759740352630615},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6834760308265686},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.5912280082702637},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.5698713660240173},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5320500135421753},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.4814407229423523},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46372029185295105},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.4623926877975464},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45688396692276},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.44696566462516785},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.41286763548851013},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.32520967721939087},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.24011483788490295},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16288083791732788}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7950043678283691},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7759740352630615},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6834760308265686},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.5912280082702637},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.5698713660240173},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5320500135421753},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.4814407229423523},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46372029185295105},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.4623926877975464},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45688396692276},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.44696566462516785},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.41286763548851013},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.32520967721939087},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.24011483788490295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16288083791732788},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C2779234561","wikidata":"https://www.wikidata.org/wiki/Q11995","display_name":"Pregnancy","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)80795-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80795-3","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"},{"id":"pmh:oai:zenodo.org:26397","is_oa":true,"landing_page_url":"https://zenodo.org/record/26397","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80795-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80795-3","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":10,"referenced_works":["https://openalex.org/W92237311","https://openalex.org/W1585022015","https://openalex.org/W1968265180","https://openalex.org/W2027319813","https://openalex.org/W2063727779","https://openalex.org/W2395639737","https://openalex.org/W3037729068","https://openalex.org/W6603790389","https://openalex.org/W6711606969","https://openalex.org/W6758781773"],"related_works":["https://openalex.org/W2035762642","https://openalex.org/W1547392259","https://openalex.org/W1584569710","https://openalex.org/W316728381","https://openalex.org/W2628190584","https://openalex.org/W4205561875","https://openalex.org/W4387645218","https://openalex.org/W1810083572","https://openalex.org/W58700807","https://openalex.org/W2130881291"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,29,35],"present":[4],"a":[5,83,116,126],"declarative":[6,101],"language":[7,109,118],"that":[8,34],"aims":[9],"at":[10],"combining":[11],"valuable":[12],"features":[13,24],"of":[14,25,47,59,76,93,106,115,129],"CLP":[15,117],"languages\u2014namely,":[16],"nondeterminism,":[17],"unification,":[18],"constraint":[19],"solving,":[20],"dynamic":[21],"data":[22,85],"structures\u2014with":[23],"conventional":[26],"programming":[27],"languages":[28],"are":[30],"accustomed":[31],"to":[32,39,67],"and":[33,61,95],"do":[36],"not":[37,80],"want":[38],"give":[40],"up,":[41],"such":[42],"as":[43,82,89,96,125],"the":[44,49,54,57,74,90,97,107,130],"syntactic":[45],"form":[46],"programs,":[48],"deterministic":[50],"control":[51],"structures\u2014in":[52],"particular":[53],"iterative":[55],"ones\u2014,":[56],"notion":[58,75],"procedure":[60],"parameter":[62],"passing.":[63],"A":[64],"key":[65],"role":[66],"gain":[68],"these":[69],"objectives":[70],"is":[71,122],"played":[72],"by":[73],"sets:":[77],"sets":[78],"serve":[79],"only":[81],"powerful":[84],"abstraction,":[86],"but":[87],"also":[88,124],"(only)":[91],"source":[92],"nondeterminism":[94],"main":[98],"support":[99],"for":[100],"(constraint)":[102],"programming.":[103],"Furthermore,":[104],"semantics":[105],"whole":[108],"can":[110],"be":[111],"described":[112],"in":[113],"terms":[114],"with":[119],"sets,":[120],"which":[121],"used":[123],"straightforward":[127],"implementation":[128],"proposed":[131],"language.":[132]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}