{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00050275","sets":["1164:4402:4422:4423"]},"path":["4423"],"owner":"1","recid":"50275","title":["Restricted Path Consistency Enforcement for any Constraint Network"],"pubdate":{"attribute_name":"公開日","attribute_value":"2004-12-04"},"_buckets":{"deposit":"661ffa9a-eb9c-4556-b640-9c79c1efaf4c"},"_deposit":{"id":"50275","pid":{"type":"depid","value":"50275","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Restricted Path Consistency Enforcement for any Constraint Network","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Restricted Path Consistency Enforcement for any Constraint Network"},{"subitem_title":"Restricted Path Consistency Enforcement for any Constraint Network","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2004-12-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Knowledge Creating Methodology Laboratory Japan Advanced Institute of Science and Technology"},{"subitem_text_value":"Knowledge Creating Methodology Laboratory Japan Advanced Institute of Science and Technology"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Knowledge Creating Methodology Laboratory Japan Advanced Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Knowledge Creating Methodology Laboratory Japan Advanced Institute of Science and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/50275/files/IPSJ-ICS04138014.pdf"},"date":[{"dateType":"Available","dateValue":"2006-12-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ICS04138014.pdf","filesize":[{"value":"644.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"25"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fbdd8ff5-152e-4f86-bebf-e61cce914a41","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2004 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"AHLEMBENHASSINE"},{"creatorName":"TUBAOHO"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ahlem, BenHassine","creatorNameLang":"en"},{"creatorName":"Tu, BaoHo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11135936","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Local consistency techniques (LC) are in the core of the constraint programming paradigm due to their preminent role in its success. The main objective of these techniques is to prune the search space and consequently to enhance the efficiency of the constraints solver. Several levels were proposed among which arc consistency (AC) is the most used one due to its low time and space complexities. However  recently few efforts were directed to enforce local consistency in an entirely distributed manner. Nevertheless  most of these works are limited only to AC property due to the effective-cost of the other existing more powerful levels. For some hard CNs applying only AC enforcement may be fruitless  case of problems initially arc-consistent. In an attempt to overcome these limitations  the main contribution of this paper is to propose a refinement of the DRAC approach (Distributed Reinforcement of Arc-Consistency) to achieve higher level of local consistency  the restricted path consistency (RPC) in a distributed manner with the minimal amount of additional constraint checks. A comprehensive empirical study was performed to highlight the benefit of using the collected knowledge for enforcing arc-consistency on any binary constraint network (CN)  especially for hard arc-consistent problems.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Local consistency techniques (LC) are in the core of the constraint programming paradigm due to their preminent role in its success. The main objective of these techniques is to prune the search space and consequently to enhance the efficiency of the constraints solver. Several levels were proposed among which arc consistency (AC) is the most used one due to its low time and space complexities. However, recently few efforts were directed to enforce local consistency in an entirely distributed manner. Nevertheless, most of these works are limited only to AC property due to the effective-cost of the other existing more powerful levels. For some hard CNs applying only AC enforcement may be fruitless, case of problems initially arc-consistent. In an attempt to overcome these limitations, the main contribution of this paper is to propose a refinement of the DRAC approach (Distributed Reinforcement of Arc-Consistency) to achieve higher level of local consistency, the restricted path consistency (RPC) in a distributed manner with the minimal amount of additional constraint checks. A comprehensive empirical study was performed to highlight the benefit of using the collected knowledge for enforcing arc-consistency on any binary constraint network (CN), especially for hard arc-consistent problems.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"84","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告知能と複雑系（ICS）"}],"bibliographicPageStart":"79","bibliographicIssueDates":{"bibliographicIssueDate":"2004-12-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"125(2004-ICS-138)","bibliographicVolumeNumber":"2004"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T07:41:53.074172+00:00","created":"2025-01-18T23:15:05.435115+00:00","links":{},"id":50275}