{"id":"https://openalex.org/W1975140573","doi":"https://doi.org/10.1142/s0218213008004163","title":"STRONG DOMAIN FILTERING CONSISTENCIES FOR NON-BINARY CONSTRAINT SATISFACTION PROBLEMS","display_name":"STRONG DOMAIN FILTERING CONSISTENCIES FOR NON-BINARY CONSTRAINT SATISFACTION PROBLEMS","publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W1975140573","doi":"https://doi.org/10.1142/s0218213008004163","mag":"1975140573"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213008004163","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008004163","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","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/A5019222560","display_name":"Kostas Stergiou","orcid":"https://orcid.org/0000-0002-5702-9096"},"institutions":[{"id":"https://openalex.org/I98805295","display_name":"University of the Aegean","ror":"https://ror.org/03zsp3p94","country_code":"GR","type":"education","lineage":["https://openalex.org/I98805295"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"KOSTAS STERGIOU","raw_affiliation_strings":["Department of Information and Communication Systems Engineering, University of the Aegean, Samos, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Systems Engineering, University of the Aegean, Samos, Greece","institution_ids":["https://openalex.org/I98805295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019222560"],"corresponding_institution_ids":["https://openalex.org/I98805295"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.08996328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"05","first_page":"781","last_page":"802"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9702000021934509,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9700999855995178,"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/computer-science","display_name":"Computer science","score":0.7401305437088013},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.6700503826141357},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6664834022521973},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6163395047187805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5576886534690857},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.541390597820282},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21972441673278809},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20424020290374756},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.06572452187538147}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7401305437088013},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.6700503826141357},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6664834022521973},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6163395047187805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5576886534690857},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.541390597820282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21972441673278809},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20424020290374756},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.06572452187538147},{"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/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":2,"locations":[{"id":"doi:10.1142/s0218213008004163","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008004163","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.424.1743","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.424.1743","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.icsd.aegean.gr/lecturers/konsterg/publications/ijait2008.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W914322","https://openalex.org/W14991534","https://openalex.org/W80144073","https://openalex.org/W155556186","https://openalex.org/W1490681211","https://openalex.org/W1855329006","https://openalex.org/W1997128923","https://openalex.org/W2000391493","https://openalex.org/W2020463765","https://openalex.org/W2041737564","https://openalex.org/W2080192364","https://openalex.org/W2099980081","https://openalex.org/W2106304333","https://openalex.org/W2113654469","https://openalex.org/W2138382848","https://openalex.org/W2149284637"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W1524973174","https://openalex.org/W2023722467"],"abstract_inverted_index":{"Domain":[0],"filtering":[1,49,70,109],"local":[2],"consistencies,":[3,7],"such":[4,26],"as":[5],"inverse":[6],"that":[8,83],"only":[9],"delete":[10],"values":[11],"and":[12,34,75,129],"do":[13],"not":[14],"add":[15],"new":[16],"constraints":[17,30,40,74],"are":[18,88],"particularly":[19],"useful":[20],"in":[21,92,111],"Constraint":[22],"Programming.":[23],"Although":[24],"many":[25],"consistencies":[27,50,71,87,110,128],"for":[28,72,107],"binary":[29,93],"have":[31,47],"been":[32],"proposed":[33,127],"evaluated,":[35],"the":[36,126,131,135],"situation":[37],"with":[38],"non-binary":[39,73,112],"is":[41,97],"quite":[42],"different.":[43],"Only":[44],"very":[45],"recently":[46],"domain":[48,69,108],"stronger":[51],"than":[52],"GAC":[53],"started":[54],"to":[55,90,99,122],"attract":[56],"interest.":[57],"Following":[58],"this":[59,117],"line":[60],"of":[61,67,85,125,134],"research,":[62],"we":[63,139],"define":[64],"a":[65,104,141],"number":[66],"strong":[68],"theoretically":[76],"compare":[77],"their":[78],"pruning":[79],"power.":[80],"We":[81,101,114],"prove":[82],"three":[84],"these":[86],"equivalent":[89,98],"maxRPC":[91],"CSPs":[94],"while":[95],"another":[96],"PIC.":[100],"also":[102],"describe":[103],"generic":[105],"algorithm":[106,118],"CSPs.":[113],"show":[115],"how":[116],"can":[119],"be":[120],"instantiated":[121],"enforce":[123],"some":[124],"analyze":[130],"worst-case":[132],"complexities":[133],"resulting":[136],"algorithms.":[137],"Finally,":[138],"make":[140],"preliminary":[142],"empirical":[143],"study.":[144]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
