Article

Backtrack Searching in the Presence of Symmetry

Authors:

Paul Walton Purdom, Jr.Authors Info & Claims

AAECC-6: Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Pages 99 - 110

Published: 04 July 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Betten A(2014)Classifying discrete objects with orbiterACM Communications in Computer Algebra10.1145/2576802.257683247:3/4(183-186)Online publication date: 28-Jan-2014
https://dl.acm.org/doi/10.1145/2576802.2576832
Betten AMonagan MCooperman GGiesbrecht M(2013)Rainbow cliques and the classification of small BLT-setsProceedings of the 38th International Symposium on Symbolic and Algebraic Computation10.1145/2465506.2465508(53-60)Online publication date: 26-Jun-2013
https://dl.acm.org/doi/10.1145/2465506.2465508
Mancini TCadoli M(2007)Exploiting functional dependencies in declarative problem specificationsArtificial Intelligence10.1016/j.artint.2007.04.017171:16-17(985-1010)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1016/j.artint.2007.04.017
Show More Cited By

Backtrack Searching in the Presence of Symmetry
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
    2. Data structures design and analysis

Recommendations

Backtrack searching in the presence of symmetry

A class of search algorithms for problems with symmetries is discussed. The algorithms take as input a symmetry group (in the form of a permutation group) and use it to avoid repeated search of equivalent portions of the search space. The symmetry ...
Hashing, searching, sketching
Backtracking tactics in the backtrack method for SAT

Backtrack is an exhaustive search method by consecutively extending partial solutions. Backtracking is a step of backtrack, which occurs when extensions cannot go deeper. So far, people have taken the depth-first backtracking tactic as default in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

AAECC-6: Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

July 1988

480 pages

ISBN:3540510834

Editor:
Teo Mora

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 04 July 1988

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Betten A(2014)Classifying discrete objects with orbiterACM Communications in Computer Algebra10.1145/2576802.257683247:3/4(183-186)Online publication date: 28-Jan-2014
https://dl.acm.org/doi/10.1145/2576802.2576832
Betten AMonagan MCooperman GGiesbrecht M(2013)Rainbow cliques and the classification of small BLT-setsProceedings of the 38th International Symposium on Symbolic and Algebraic Computation10.1145/2465506.2465508(53-60)Online publication date: 26-Jun-2013
https://dl.acm.org/doi/10.1145/2465506.2465508
Mancini TCadoli M(2007)Exploiting functional dependencies in declarative problem specificationsArtificial Intelligence10.1016/j.artint.2007.04.017171:16-17(985-1010)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1016/j.artint.2007.04.017
Cadoli MMancini T(2006)Automated reformulation of specifications by safe delay of constraintsArtificial Intelligence10.5555/1644520.1644704170:8-9(779-801)Online publication date: 1-Jun-2006
https://dl.acm.org/doi/10.5555/1644520.1644704
Sellmann MVan Hentenryck P(2005)Structural symmetry breakingProceedings of the 19th international joint conference on Artificial intelligence10.5555/1642293.1642341(298-303)Online publication date: 30-Jul-2005
https://dl.acm.org/doi/10.5555/1642293.1642341
Goldberg E(2005)Testing Satisfiability of CNF Formulas by Computing a Stable Set of PointsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-004-9420-543:1-4(65-89)Online publication date: 1-Jan-2005
https://dl.acm.org/doi/10.1007/s10472-004-9420-5
Mancini TCadoli M(2005)Detecting and breaking symmetries by reasoning on problem specificationsProceedings of the 6th international conference on Abstraction, Reformulation and Approximation10.1007/11527862_12(165-181)Online publication date: 26-Jul-2005
https://dl.acm.org/doi/10.1007/11527862_12
Dixon HGinsberg MParkes A(2004)Generalizing Boolean satisfiability IJournal of Artificial Intelligence Research10.5555/1622467.162247421:1(193-243)Online publication date: 1-Feb-2004
https://dl.acm.org/doi/10.5555/1622467.1622474
Luks ERoy A(2004)The Complexity of Symmetry-Breaking FormulasAnnals of Mathematics and Artificial Intelligence10.1023/B:AMAI.0000018578.92398.1041:1(19-45)Online publication date: 1-May-2004
https://dl.acm.org/doi/10.1023/B%3AAMAI.0000018578.92398.10
Aloul FRamani AMarkov ISakallah KAckland B(2002)Solving difficult SAT instances in the presence of symmetryProceedings of the 39th annual Design Automation Conference10.1145/513918.514102(731-736)Online publication date: 10-Jun-2002
https://dl.acm.org/doi/10.1145/513918.514102
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Backtrack searching in the presence of symmetry

Hashing, searching, sketching

Backtracking tactics in the backtrack method for SAT

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations