Arc and path consistence revisited
Artificial Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
Radio Link Frequency Assignment
Constraints
Path-consistency: when space misses time
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Dynamic CSPs for Interval-Based Temporal Reasoning
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Solving Non-binary CSPs Using the Hidden Variable Encoding
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Reasoning with Numeric and Symbolic Time Information
Artificial Intelligence Review
Saving Support-Checks Does Not Always Save Time
Artificial Intelligence Review
AI Communications - Special issue on: Spatial and temporal reasoning
An efficient consistency algorithm for the temporal constraint satisfaction problem
AI Communications - Special issue on: Spatial and temporal reasoning
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Maintaining global consistency of temporal constraints in a dynamic environment
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
AI Communications - Spatial and Temporal Reasoning
AI Communications - Spatial and Temporal Reasoning
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Properties of tree convex constraints
Artificial Intelligence
Managing Conditional and Composite CSPs
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Efficient Handling of Relational Database Combinatorial Queries Using CSPs
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Constraint satisfaction problems solved by semidefinite relaxations
WSEAS Transactions on Computers
Solving connected row convex constraints by variable elimination
Artificial Intelligence
Tractable tree convex constraint networks
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A fast arc consistency algorithm for n-ary constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
The ultrametric constraint and its application to phylogenetics
Journal of Artificial Intelligence Research
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Maintaining arc consistency using adaptive domain ordering
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Computers and Industrial Engineering
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
Journal of Mathematical Modelling and Algorithms
Proceedings of the 14th symposium on Principles and practice of declarative programming
Hi-index | 0.00 |
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically efficient and extensible. However its worst case time complexity was not considered optimal since the first complexity result for AC-3 [Mackworth and Freuder, 1985] with the bound O(ed3), where e is the number of constraints and d the size of the largest domain. In this paper, we show suprisingly that AC-3 achieves the optimal worst case time complexity with O(ed2). The result is applied to obtain a path consistency algorithm which has the same time and space complexity as the best known theoretical results. Our experimental results show that the new approach to AC-3 is comparable to the traditional AC-3 implementation for simpler problems where AC-3 is more efficient than other algorithms and significantly faster on hard instances.