{"id":"https://openalex.org/W2202665240","doi":"https://doi.org/10.1017/s1471068415000290","title":"Adding partial functions to Constraint Logic Programming with sets","display_name":"Adding partial functions to Constraint Logic Programming with sets","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2202665240","doi":"https://doi.org/10.1017/s1471068415000290","mag":"2202665240"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068415000290","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000290","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1507.06852","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MAXIMILIANO CRISTI\u00c1","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109384","display_name":"Centro Internacional Franco-Argentino de Ciencias de la Informaci\u00f3n y de Sistemas","ror":"https://ror.org/02m19wv39","country_code":"AR","type":"facility","lineage":["https://openalex.org/I151201029","https://openalex.org/I21491767","https://openalex.org/I4141589","https://openalex.org/I4210107757","https://openalex.org/I4210109384","https://openalex.org/I4210123736","https://openalex.org/I4387155568"]}],"countries":["AR"],"is_corresponding":true,"raw_author_name":"MAXIMILIANO CRISTI\u00c1","raw_affiliation_strings":["CIFASIS and UNR, Rosario, Argentina (e-mail:"],"affiliations":[{"raw_affiliation_string":"CIFASIS and UNR, Rosario, Argentina (e-mail:","institution_ids":["https://openalex.org/I4210109384"]}]},{"author_position":"middle","author":{"id":null,"display_name":"GIANFRANCO ROSSI","orcid":null},"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":false,"raw_author_name":"GIANFRANCO ROSSI","raw_affiliation_strings":["Universit\u00e0 degli Studi di Parma, Parma, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Parma, Parma, Italy (e-mail:","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"last","author":{"id":null,"display_name":"CLAUDIA FRYDMAN","orcid":null},"institutions":[{"id":"https://openalex.org/I143002897","display_name":"Universit\u00e9 de Toulon","ror":"https://ror.org/02m9kbe37","country_code":"FR","type":"education","lineage":["https://openalex.org/I143002897"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"CLAUDIA FRYDMAN","raw_affiliation_strings":["Aix Marseille Univ., CNRS, ENSAM, Univ. de Toulon, LSIS UMR 7296, France (e-mail:"],"affiliations":[{"raw_affiliation_string":"Aix Marseille Univ., CNRS, ENSAM, Univ. de Toulon, LSIS UMR 7296, France (e-mail:","institution_ids":["https://openalex.org/I143002897","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210109384"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.11280616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"4-5","first_page":"651","last_page":"665"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.49779999256134033,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.49779999256134033,"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/T10142","display_name":"Formal Methods in Verification","score":0.30070000886917114,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.08820000290870667,"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.7936000227928162},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6851000189781189},{"id":"https://openalex.org/keywords/partial-function","display_name":"Partial function","score":0.6603000164031982},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.5453000068664551},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5419999957084656},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.5041999816894531},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.4830000102519989},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.45159998536109924},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.4235999882221222},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41350001096725464}],"concepts":[{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.7936000227928162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7741000056266785},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6953999996185303},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6851000189781189},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.6603000164031982},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.5453000068664551},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5419999957084656},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.5041999816894531},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.4830000102519989},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.45159998536109924},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4343999922275543},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.4235999882221222},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41350001096725464},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.397599995136261},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C195701839","wikidata":"https://www.wikidata.org/wiki/Q4008398","display_name":"Partial evaluation","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.3411000072956085},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.32839998602867126},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.328000009059906},{"id":"https://openalex.org/C94633896","wikidata":"https://www.wikidata.org/wiki/Q7140378","display_name":"Partial order reduction","level":3,"score":0.32170000672340393},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C201677973","wikidata":"https://www.wikidata.org/wiki/Q1209840","display_name":"Specification language","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29179999232292175},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.28850001096725464},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.27459999918937683},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C2777394884","wikidata":"https://www.wikidata.org/wiki/Q762268","display_name":"Automatic programming","level":2,"score":0.2703000009059906},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.26190000772476196},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.26089999079704285}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068415000290","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000290","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:arXiv.org:1507.06852","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.06852","pdf_url":"https://arxiv.org/pdf/1507.06852","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1507.06852","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.06852","pdf_url":"https://arxiv.org/pdf/1507.06852","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1772855117","https://openalex.org/W2007319395","https://openalex.org/W2027319813","https://openalex.org/W2036311242","https://openalex.org/W2085716817","https://openalex.org/W2490970523","https://openalex.org/W4254354208","https://openalex.org/W6637580116"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Partial":[1],"functions":[2,36,54],"are":[3],"common":[4],"abstractions":[5],"in":[6,102,138],"formal":[7],"specification":[8],"notations":[9],"such":[10],"as":[11,37,66],"Z,":[12],"B":[13],"and":[14,72],"Alloy.":[15],"Conversely,":[16],"executable":[17],"programming":[18],"languages":[19],"usually":[20],"provide":[21],"little":[22],"or":[23],"no":[24],"support":[25],"for":[26,106],"them.":[27],"In":[28,87],"this":[29],"paper":[30,90],"we":[31],"propose":[32],"to":[33,41,74,104],"add":[34],"partial":[35,53,113,132],"a":[38,42,125],"primitive":[39,109],"feature":[40],"Constraint":[43],"Logic":[44],"Programming":[45],"(CLP)":[46],"language,":[47],"namely":[48],"{":[49,61,94],"log":[50,62,95],"}.":[51],"Although":[52],"could":[55],"be":[56],"programmed":[57],"on":[58],"top":[59],"of":[60,77,116,127],"},":[63],"providing":[64],"them":[65],"first-class":[67],"citizens":[68],"adds":[69],"valuable":[70],"flexibility":[71],"generality":[73],"the":[75,81,89,93,107,117],"form":[76],"set-theoretic":[78],"formulas":[79],"that":[80],"language":[82],"can":[83],"safely":[84],"deal":[85],"with.":[86],"particular,":[88],"shows":[91],"how":[92],"}":[96],"constraint":[97],"solver":[98],"is":[99,120],"naturally":[100],"extended":[101],"order":[103],"accommodate":[105],"new":[108,118],"constraints":[110],"dealing":[111],"with":[112],"functions.":[114],"Efficiency":[115],"version":[119],"empirically":[121],"assessed":[122],"by":[123],"running":[124],"number":[126],"non-trivial":[128],"set-theoretical":[129],"goals":[130],"involving":[131],"functions,":[133],"obtained":[134],"from":[135],"specifications":[136],"written":[137],"Z.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}