{"id":"https://openalex.org/W2080531368","doi":"https://doi.org/10.1145/1149114.1149118","title":"Soft concurrent constraint programming","display_name":"Soft concurrent constraint programming","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W2080531368","doi":"https://doi.org/10.1145/1149114.1149118","mag":"2080531368"},"language":"en","primary_location":{"id":"doi:10.1145/1149114.1149118","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1149114.1149118","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0208008","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Stefano Bistarelli","orcid":null},"institutions":[{"id":"https://openalex.org/I39387349","display_name":"University of Chieti-Pescara","ror":"https://ror.org/00qjgza05","country_code":"IT","type":"education","lineage":["https://openalex.org/I39387349"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Bistarelli","raw_affiliation_strings":["C.N.R., Pisa, Italy and Universit\u00e0 degli Studi \u201cG. d'Annunzio\u201d, Pescara, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"C.N.R., Pisa, Italy and Universit\u00e0 degli Studi \u201cG. d'Annunzio\u201d, Pescara, Italy","institution_ids":["https://openalex.org/I39387349"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ugo Montanari","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Ugo Montanari","raw_affiliation_strings":["Universit\u00e0 di Pisa, Italy, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Pisa, Italy, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":null,"display_name":"Francesca Rossi","orcid":null},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesca Rossi","raw_affiliation_strings":["Universit\u00e0 di Padova, Italy, Padua, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Padova, Italy, Padua, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8978,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.96677131,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"563","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9575999975204468,"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.9575999975204468,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.017400000244379044,"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.009700000286102295,"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-programming","display_name":"Constraint programming","score":0.7103000283241272},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.7070000171661377},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6527000069618225},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5806000232696533},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5486999750137329},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5347999930381775},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5123000144958496},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5013999938964844}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7124999761581421},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.7103000283241272},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.7070000171661377},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6527000069618225},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5806000232696533},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5486999750137329},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5347999930381775},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5123000144958496},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5013999938964844},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.45719999074935913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4487000107765198},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38850000500679016},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3582000136375427},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.3571999967098236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3434999883174896},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.30489999055862427},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.2948000133037567},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C199776023","wikidata":"https://www.wikidata.org/wiki/Q202875","display_name":"Negotiation","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1149114.1149118","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1149114.1149118","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0208008","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0208008","pdf_url":"https://arxiv.org/pdf/cs/0208008","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},{"id":"pmh:oai:www.research.unipd.it:11577/2485457","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2485457","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"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":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0208008","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0208008","pdf_url":"https://arxiv.org/pdf/cs/0208008","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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/W1564110513","https://openalex.org/W1582927633","https://openalex.org/W2005863443","https://openalex.org/W2120203610","https://openalex.org/W2156525231","https://openalex.org/W2161353020","https://openalex.org/W2164297069","https://openalex.org/W2569549435"],"related_works":[],"abstract_inverted_index":{"Soft":[0],"constraints":[1,4,44,79],"extend":[2],"classical":[3,55],"to":[5,15,36,80,117,126],"represent":[6],"multiple":[7],"consistency":[8],"levels,":[9],"and":[10,19,66,82,121,124,134],"thus":[11],"provide":[12],"a":[13,87],"way":[14],"express":[16,118],"preferences,":[17,133],"fuzziness,":[18],"uncertainty.":[20],"While":[21],"there":[22,34],"are":[23,151],"many":[24,106],"soft":[25,43,64,78,97,137],"constraint":[26,57,138],"solving":[27],"formalisms,":[28],"even":[29,147],"distributed":[30],"ones,":[31],"as":[32],"yet":[33],"seems":[35],"be":[37,46,101],"no":[38],"concurrent":[39,56],"programming":[40,59,94],"framework":[41,60],"where":[42],"can":[45,61,76,100,140],"handled.":[47],"In":[48,109],"this":[49,92],"article":[50],"we":[51,67],"show":[52],"how":[53],"the":[54,84,111,135,145],"(cc)":[58],"work":[62],"with":[63],"constraints,":[65],"also":[68,102,125],"propose":[69],"an":[70,142],"extension":[71],"of":[72,132],"cc":[73,98],"languages":[74],"which":[75],"use":[77],"prune":[81],"direct":[83],"search":[85],"for":[86],"solution.":[88],"We":[89],"believe":[90],"that":[91],"new":[93],"paradigm,":[95],"called":[96],"(scc),":[99],"very":[103],"useful":[104],"in":[105,130],"Web-related":[107],"scenarios.":[108],"fact,":[110],"language":[112],"level":[113],"allows":[114],"Web":[115],"agents":[116,146],"their":[119,128,149],"interaction":[120],"negotiation":[122],"protocols,":[123],"post":[127],"requests":[129,150],"terms":[131],"underlying":[136],"solver":[139],"find":[141],"agreement":[143],"among":[144],"if":[148],"incompatible.":[152]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}