Arc and path consistence revisited
Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Improving domain filtering using restricted path consistency
CAIA '95 Proceedings of the 11th Conference on Artificial Intelligence for Applications
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Domain filtering consistencies
Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A greedy approach to establish singleton arc consistency
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Theoretical Computer Science
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
Combination: automated generation of puzzles with constraints
Proceedings of the 2011 ACM Symposium on Applied Computing
Integrating strong local consistencies into constraint solvers
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Journal of Artificial Intelligence Research
A framework for decision-based consistencies
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Detecting and exploiting subproblem tractability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but they have a high time complexity. In this paper, we give a lower bound to the worst-case time complexity of enforcing SAC on binary constraints. We discuss two interesting features of SAC. The first feature leads us to propose an algorithm for SAC that has optimal time complexity when restricted to binary constraints. The second feature leads us to extend SAC to a stronger level of local consistency that we call Bidirectional SAC (BiSAC). We also show the relationship between SAC and the propagation of disjunctive constraints.