Excluding Symmetries in Constraint-Based Search-Reference-Cited by-同舟云学术

Excluding Symmetries in Constraint-Based Search

Published:1999 Issue: Volume: Page:73-87
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP’99
language:
Short-container-title:

Author:

Backofen Rolf,Will Sebastian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-48085-3_6

Reference10 articles.

1. Aguirre, A.S.M.: How to use symmetries in boolean constraint solving. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming, Selected Research, ch. 16, pp. 287–306. The MIT Press, Cambridge (1993)

2. Lecture Notes in Computer Science;R. Backofen,1998

3. Lecture Notes in Computer Science;B. Benhamou,1994

4. Benhamou, B., Sais, L.: Tractability through symmetries in propositional calculus. Journal of Automated Reasoning 12, 89–102 (1994)

5. Crawford, J.M., Ginsberg, M., Luks, E., Roy, A.: Symmetry breaking predicates for search problems. In: Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), pp. 149–159 (1996)

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

1. Parallel machine scheduling with tool loading: a constraint programming approach;International Journal of Production Research;2018-01-05

2. On the Decision Trees with Symmetries;Computer Science – Theory and Applications;2018

3. Symmetries, almost symmetries, and lazy clause generation;Constraints;2014-03-16

4. Lightweight dynamic symmetry breaking;Constraints;2013-12-13

5. Dominance Driven Search;Lecture Notes in Computer Science;2013