Yonggang Zhang, Qian Yin, Xing-Quan Zhu, Zhanshan Li, Sibo Zhang, Quan Liu
{"title":"New Algorithms for Bidirectional Singleton Arc Consistency","authors":"Yonggang Zhang, Qian Yin, Xing-Quan Zhu, Zhanshan Li, Sibo Zhang, Quan Liu","doi":"10.1155/2013/904768","DOIUrl":null,"url":null,"abstract":"Bidirectional singleton arc consistency (BiSAC) which is an extended singleton arc consistency (SAC) has been proposed recently. The first contribution of this paper is to propose and prove two theorems of BiSAC theoretically (one is a property of BiSAC and the other is the property of allowing the deletion of some BiSAC-inconsistent values). Secondly, based on these properties we present two algorithms, denoted by BiSAC-DF and BiSAC-DP, to enforce BiSAC. Also, we prove their correctness and analyze the space and time complexity of them in detail. Besides, for special circumstances, we show that BiSAC-DF admits a worst-case time complexity in and a best one in when the problem is an already BiSAC, while BiSAC-DP also has the same best one when the tightness is small. Finally, experiments on a wide range of CSP instances show BiSAC-DF and BiSAC-DP are usually around one order of magnitude faster than the existing BiSAC-1. For some special instances, BiSAC-DP is about two orders of magnitude efficient.","PeriodicalId":18319,"journal":{"name":"Mathematical Problems in Engineering","volume":"2013 1","pages":"1-10"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2013/904768","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Problems in Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1155/2013/904768","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
Abstract
Bidirectional singleton arc consistency (BiSAC) which is an extended singleton arc consistency (SAC) has been proposed recently. The first contribution of this paper is to propose and prove two theorems of BiSAC theoretically (one is a property of BiSAC and the other is the property of allowing the deletion of some BiSAC-inconsistent values). Secondly, based on these properties we present two algorithms, denoted by BiSAC-DF and BiSAC-DP, to enforce BiSAC. Also, we prove their correctness and analyze the space and time complexity of them in detail. Besides, for special circumstances, we show that BiSAC-DF admits a worst-case time complexity in and a best one in when the problem is an already BiSAC, while BiSAC-DP also has the same best one when the tightness is small. Finally, experiments on a wide range of CSP instances show BiSAC-DF and BiSAC-DP are usually around one order of magnitude faster than the existing BiSAC-1. For some special instances, BiSAC-DP is about two orders of magnitude efficient.
期刊介绍:
Mathematical Problems in Engineering is a broad-based journal which publishes articles of interest in all engineering disciplines. Mathematical Problems in Engineering publishes results of rigorous engineering research carried out using mathematical tools. Contributions containing formulations or results related to applications are also encouraged. The primary aim of Mathematical Problems in Engineering is rapid publication and dissemination of important mathematical work which has relevance to engineering. All areas of engineering are within the scope of the journal. In particular, aerospace engineering, bioengineering, chemical engineering, computer engineering, electrical engineering, industrial engineering and manufacturing systems, and mechanical engineering are of interest. Mathematical work of interest includes, but is not limited to, ordinary and partial differential equations, stochastic processes, calculus of variations, and nonlinear analysis.