{"id":"https://openalex.org/W2002958195","doi":"https://doi.org/10.1080/09528130410001724968","title":"Distributed singleton consistency","display_name":"Distributed singleton consistency","publication_year":2004,"publication_date":"2004-04-01","ids":{"openalex":"https://openalex.org/W2002958195","doi":"https://doi.org/10.1080/09528130410001724968","mag":"2002958195"},"language":"en","primary_location":{"id":"doi:10.1080/09528130410001724968","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528130410001724968","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","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/A5001839952","display_name":"Ilias Sakellariou","orcid":"https://orcid.org/0000-0003-3522-6045"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilias Sakellariou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066340205","display_name":"Ioannis Vlahavas","orcid":"https://orcid.org/0000-0003-3477-8825"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ioannis Vlahavas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3338,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74167474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"2","first_page":"107","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9760000109672546,"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/singleton","display_name":"Singleton","score":0.9111602306365967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8472129106521606},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.7697904706001282},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6007792949676514},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5585771799087524},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5433207154273987},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5370705723762512},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4772484302520752},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4177650213241577},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4140876531600952},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35942232608795166},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34944409132003784},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12110424041748047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11396476626396179},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06719669699668884}],"concepts":[{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.9111602306365967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8472129106521606},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.7697904706001282},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6007792949676514},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5585771799087524},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5433207154273987},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5370705723762512},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4772484302520752},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4177650213241577},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4140876531600952},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35942232608795166},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34944409132003784},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12110424041748047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11396476626396179},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06719669699668884},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C2779234561","wikidata":"https://www.wikidata.org/wiki/Q11995","display_name":"Pregnancy","level":2,"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/09528130410001724968","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528130410001724968","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W57237496","https://openalex.org/W1562839035","https://openalex.org/W1564104211","https://openalex.org/W1977960672","https://openalex.org/W1986204478","https://openalex.org/W2054700680","https://openalex.org/W2070595315","https://openalex.org/W2086991642","https://openalex.org/W2091644215","https://openalex.org/W2091984336","https://openalex.org/W2112957923","https://openalex.org/W2113654469","https://openalex.org/W2132050231","https://openalex.org/W2135432705","https://openalex.org/W2138037655","https://openalex.org/W2138382848","https://openalex.org/W2153621541","https://openalex.org/W2158896662","https://openalex.org/W2160458341","https://openalex.org/W2346933546","https://openalex.org/W2604137245","https://openalex.org/W2608239929","https://openalex.org/W2913800047","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W4303044088","https://openalex.org/W1486916474","https://openalex.org/W96881443","https://openalex.org/W2012694101","https://openalex.org/W1550482496","https://openalex.org/W2737098235","https://openalex.org/W2140769824"],"abstract_inverted_index":{"Distributed":[0,45],"constraint":[1],"satisfaction":[2],"has":[3,25],"drawn":[4],"much":[5],"attention":[6],"in":[7,22],"the":[8,19,23,54,68,75,89,93],"past":[9],"years,":[10],"with":[11,106],"a":[12,39,60,81,111],"number":[13,82],"of":[14,70,83,98,113],"algorithms":[15],"proposed":[16],"to":[17,77,80],"tackle":[18],"problem.":[20],"Research":[21],"area":[24],"followed":[26],"two":[27,96],"directions:":[28],"distributed":[29,33,41],"search":[30],"techniques":[31],"and":[32,95],"filtering":[34,42,63],"techniques.":[35],"This":[36],"paper":[37,87],"presents":[38,88],"new":[40],"algorithm,":[43],"named":[44],"Singleton":[46],"Arc":[47],"Consistency":[48],"(Dis-SAC),":[49],"which":[50],"is":[51,59],"based":[52],"on":[53,110],"singleton":[55,71],"consistency":[56,72],"algorithm.":[57],"Dis-SAC":[58],"parallel,":[61],"coarse-grain":[62],"algorithm":[64,94],"aimed":[65],"at":[66],"improving":[67],"performance":[69],"by":[73],"distributing":[74],"work":[76],"be":[78],"done":[79],"agents.":[84],"The":[85],"current":[86],"basic":[90],"idea":[91],"behind":[92],"versions":[97],"it":[99],"that":[100],"employ":[101],"different":[102],"communication":[103],"policies":[104],"along":[105],"experimental":[107],"results":[108],"obtained":[109],"set":[112],"random":[114],"binary":[115],"CSP":[116],"problems.":[117]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-15T07:11:24.734988","created_date":"2025-10-10T00:00:00"}