ArticlesGenerating effective symmetry-breaking predicates for search problems
References (15)
Isomorph-free exhaustive generation
Journal of Algorithms
(1998)- et al.
Symmetry-breaking predicates for search problems
Fifth International Conference on Principles of Knowledge Representation and Reasoning
(1996) - et al.
Isomorph-free model enumeration: A new method for checking relational specifications
ACM Transactions on Programming Languages and Systems
(March 1998) - et al.
Better verification through symmetry
Formal Methods in System Design
(August 1996) - et al.
Backtracking algorithms for constraint satisfaction problems. Technical Report 56, UC-Irvine
(1999) - et al.
Planning as satisfiability
Proceedings of the 10th European Conference on Artificial Intelligence
(1992) - et al.
Exploiting symmetry in lifted csps
AAAI97
(1997)
There are more references available in the full text version of this article.
Cited by (10)
Propagation algorithms for lexicographic ordering constraints
2006, Artificial IntelligencePardinus: A Temporal Relational Model Finder
2022, Journal of Automated ReasoningIncremental symmetry breaking constraints for graph search problems
2020, AAAI 2020 - 34th AAAI Conference on Artificial IntelligenceConstraint normalization and parameterized caching for quantitative program analysis
2017, Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software EngineeringRanger: Parallel analysis of alloy models by range partitioning
2013, 2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - ProceedingsParameterized complexity results in symmetry breaking
2010, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 2004 Elsevier Ltd. All rights reserved.