MaxRPC Algorithms Based on Bitwise Operations

Guo, Jinsong; Li, Zhanshan; Zhang, Liang; Geng, Xiurui

doi:10.1007/978-3-642-23786-7_29

Cited by 6 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 3 presents the experimental results of the CT, PCT ds @5 and pf all algorithms on some (series and singleton) binary constraints instances. In this experiment, we combine two consistency algorithms: CT and lMaxRPC bit [35] for the pf all algorithm. Both algorithms are bit-based algorithms, and lMaxRPC bit has stronger consistency.…”

Section: B Experiments On Binary Constraint Instancesmentioning

confidence: 99%

A Novel Multi-Thread Parallel Constraint Propagation Scheme

Zhe

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

Constraint Programming (CP) is an efficient technique for solving combinatorial (optimization) problems. In modern constraint solver, a CP Model is defined over reversible variables that take values in domains and propagators which filter the domains of the variables. Constraint propagation scheme schedules the propagators. A reasonable constraint propagation algorithm can improve the efficiency of solving CP problems. In this paper, we propose two efficient parallel propagation schemes based on multi-thread technique for table constraint. First, we give the formal definition of the parallel consistency and prove that the parallel propagation scheme is equivalent to the classic serial propagation scheme. Then, we propose two parallel propagation schemes: static submission and dynamic submission, which exploit work stealing thread pool and atomic operations to parallelize the classic propagation of table constraint. Finally, extensive experiments on various types of problems show that the two parallel schemes outperform their original serial version on a large number of instances. The results demonstrate the competitiveness of parallel propagation algorithms on solving extensional constraints. INDEX TERMS Constraint programming, constraint satisfaction problem, parallel constraint propagation, parallel generalized arc consistency, simple tabular reduction.

show abstract

Section: B Experiments On Binary Constraint Instancesmentioning

confidence: 99%

A Novel Multi-Thread Parallel Constraint Propagation Scheme

Zhe

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…Further experiments show that lmaxRPC3 and lmaxRPC3rm are best suited in the preprocessing phase, while lmaxRPC3rm is best suited to use during search [19]. This paper analyzes the characteristics of the popular maxRPC algorithms: the search for a PC-support must be done with iterating the entire domain.…”

Section: Introductionmentioning

confidence: 99%

lmaxRPCls: An Algorithm Utilizing Light Symmetry for Approximating maxRPC in Constraint Programming

Zhang¹,

Song²,

Li³

2017

Proceedings of the 2017 2nd International Conference on Control, Automation and Artificial Intelligence (CAAI 2017)

Self Cite

View full text Add to dashboard Cite

Abstract-Constraint satisfaction problem (CSP) can be widely applied in many areas. This paper investigates the maximum restricted path consistency algorithm. There is a large quantity of useless checks in the process of searching for a PC-support with the most popular algorithm lmaxRPC3rm. Since lmaxRPC3rm has to examine the whole domain of a variable to ascertain whether a PC-support exists. The efficiency of the search can be improved by eliminating such useless checks. Firstly, this paper analyses the features which accounts for the existence of these ineffective checks. And then, this paper discusses some methods of solving these problems. Afterwards, a new data structure is put forward to strengthen residual supports and weaken the use of multidirectionality to narrow the range of search. A new algorithm, lmaxRPCls, which exploits the results above is proposed and it is proved that lmaxRPCls is correct and complete. It is also proved that the time complexity of this new algorithm is better than that of lmaxRPC3rm. Experimental results show that lmaxRPCls performs better in most benchmark instances and it can improve the performance by 65% in the best case.

show abstract

“…Dear editor, Arc consistency (AC) [1] is currently the most popular local consistency for solving constraint satisfaction problems (CSP). To solve CSPs more efficiently, extensive work [2][3][4] has been done to find local consistencies that perform better than AC. Efforts have primarily been focused on consistencies that are stronger than AC.…”

mentioning

confidence: 99%

“…It is never easy to determine the optimal tradeoff between a consistency's pruning ability and its propagation cost. In recent years, numerous stronger local consistencies, such as max-restricted path consistency (maxRPC) [2], partitionone-ac (POAC) [3], neighborhood singleton arc consistency (NSAC) and restricted NSAC (RNSAC) [4] have been shown to be competitive with AC. These stronger consistencies have been shown to outperform AC on a number of problems.…”

mentioning

confidence: 99%

“…Experimental details. We evaluated the performances of FCC and EFCC by comparing the search algorithms FC bit and EFC bit with AC3 bit [1], lMaxRPC bit [2] and rRPC3 [6], which have stronger consistencies. To give readers a straightforward impression of the efficacies of the different local consistencies, we first evaluate the search algorithms using two common heuristics: dom and dom/wdeg.…”

mentioning

confidence: 99%

See 1 more Smart Citation