Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets-Reference-Cited by-同舟云学术

Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets

Published:2016 Issue: Volume: Page:207-223
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Demeulenaere Jordan,Hartert Renaud,Lecoutre Christophe,Perez Guillaume,Perron Laurent,Régin Jean-Charles,Schaus Pierre

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-44953-1_14

Reference35 articles.

1. Bessiere, C., Régin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997, pp. 398–404 (1997)

2. Bessiere, C., Régin, J.-C., Yap, R., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165(2), 165–185 (2005)

3. Bliek, C.: Wordwise algorithms and improved heuristics for solving hard constraint satisfaction problems. Technical Report 12–96-R045, ERCIM (1996)

4. Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACM Lett. Programm. Lang. Syst. 2(1–4), 59–69 (1993)

5. Van Cauwelaert, S., Lombardi, M., Schaus, P.: A visual web tool to perform what-if analysis of optimization approaches. Technical report, UCLouvain (2016)

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved bit-based filtering algorithm for regular constraint;Expert Systems with Applications;2024-01

2. Efficient Lookahead Decision Trees;Lecture Notes in Computer Science;2024

3. Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches;Lecture Notes in Computer Science;2024

4. A Constraint Programming Model for Scheduling the Unloading of Trains in Ports;2023 IEEE 35th International Conference on Tools with Artificial Intelligence (ICTAI);2023-11-06

5. Graph constraints refined for transitive relations;Knowledge-Based Systems;2023-05