Conference Paper

Making AC-3 an Optimal Algorithm.

Conference: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001
Source: DBLP

ABSTRACT The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Sat- isfaction 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 (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 opti- mal worst case time complexity with (ed2). The result is applied to obtain a path consistency algo- rithm which has the same time and space complex- ity as the best known theoretical results. Our exper- imental results show that the new approach to AC-3 is comparable to the traditional AC-3 implementa- tion for simpler problems where AC-3 is more effi- cient than other algorithms and significantly faster on hard instances. simplicity of arc revision in AC-3 makes it convenient for implementation and amenable to various extensions for many constraint systems. Thus while AC-3 is considered as being sub-optimal, it often is the algorithm of choice and can out- perform other theoretically optimal algorithms. In this paper, we show that AC-3 achieves worst case op- timal time complexity of (ed2). This result is surprising since AC-3 being a coarse grained "arc revision" algorithm (Mackworth, 1977), is considered to be non-optimal. The known results for optimal algorithms are all on fine grained "value revision" algorithms. Preliminary experiments show that the new AC-3 is comparable to the traditional implemen- tations on easy CSP instances where AC-3 is known to be substantially better than the optimal fine grained algorithms. In the hard problem instances such as those from the phase transition, the new AC-3 is significantly better and is compa- rable to the best known algorithms such as AC-6. We also show that the results for AC-3 can be applied immediately to obtain a path consistency algorithm which has the same time and space complexity as the best known theoretical results. 1

0 Bookmarks
 · 
75 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: For the enterprises organised in several distributed production sites, usually, production scheduling models presume either an instantaneous delivery of products or an unlimited number of available vehicles for transporting products. However, the transportation of the intermediate products to the sites is an important activity within the whole process of manufacturing, and the efficient coordination of production and transportation becomes a challenging problem in the actual higher collaborative and competitive environments. This work focuses on the integrated production and transportation scheduling properly managing the resources capacity, material flows and temporal interdependencies between sites. A case-study is reported and the industrial problem under consideration is modelled as a constraint satisfaction problem (CSP). Besides scheduling under resource constraints, the model presented in this paper expands the packing problem to the area of transportation operations scheduling. It is implemented under the constraint programming language CHIP V5. The provided solutions determine values for the various variables associated to the production and transportation operations realised on the whole multi-site, as well as the curves with the profile of the total consumption of resources in time.
    International Journal of Computer Integrated Manufacturing 01/2012; · 0.94 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one, the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton. This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during the inference process. We present extensive experiments that show the benefit of our two approaches.
    Constraints 01/2011; · 0.74 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases the complexity result specializes to the worst case time complexity of the classical methods.
    04/2012;

Full-text

View
0 Downloads
Available from