A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Constraint Programming and Graph Algorithms
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
When do bounds and domain propagation lead to the same search space
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Constraint programming and maths programming
The Knowledge Engineering Review
When do bounds and domain propagation lead to the same search space?
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming finite-domain constraint propagators in Action Rules
Theory and Practice of Logic Programming
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
Efficient constraint propagation engines
ACM Transactions on Programming Languages and Systems (TOPLAS)
A quadratic propagator for the inter-distance constraint
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Decompositions of all different, global cardinality and related constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Making bound consistency as effective as arc consistency
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An abstract domain extending difference-bound matrices with disequality constraints
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Autonomous dynamic reconfiguration in multi-agent systems: improving the quality and efficiency of collaborative problem solving
Decomposition of the NVALUE constraint
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The alldifferent constraint with precedences
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
The design of cryptographic S-boxes using CSPs
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Multiconsistency and robustness with global constraints
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The all different and global cardinality constraints on set, multiset and tuple variables
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Views and iterators for generic constraint implementations
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
On the separability of subproblems in benders decompositions
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finite domain bounds consistency revisited
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Predicting good propagation methods for constraint satisfaction
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
View-based propagator derivation
Constraints
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
| Hi-index | 0.00 |
Some n-ary constraints such as the alldiff constraints arise naturally in real life constraint satisfaction problems (CSP). General purpose filtering algorithms could be applied to such constraints. By taking the semantics of the constraint into account, it is possible to design more efficient filtering algorithms. When the domains of the variables are totally ordered (e.g. all values are integers). then filtering based on bound consistency may be very useful. We present in this paper a filtering algorithm for the alldiff constraint based on bound consistency whose running time complexity is very low. More precisely, for a constraint involving n variables, the time complexity of the algorithm is O(nlog(n)) which improyes preyionsly published results. The implementation of this algorithm is cliscussed. and we give some experimental results that prove its practical utility.