The g12 project: mapping solver independent models to efficient solutions

Authors:
Peter J. Stuckey;Maria Garcia de la Banda;Michael Maher;Kim Marriott;John Slaney;Zoltan Somogyi;Mark Wallace;Toby Walsh
Affiliations:
NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia;School of Comp. Sci. & Soft. Eng., Monash University, Australia;NICTA Kensington Laboratory, University of New South Wales, Australia;School of Comp. Sci. & Soft. Eng., Monash University, Australia;NICTA Canberra Laboratory, Canberra, ACT, Australia;NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia;School of Comp. Sci. & Soft. Eng., Monash University, Australia;NICTA Kensington Laboratory, University of New South Wales, Australia
Venue:
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Year:
2005

Citing 0
Cited 9

Global difference constraint propagation for finite domain solvers

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Cadmium: An Implementation of ACD Term Rewriting

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Demand-Driven Normalisation for ACD Term Rewriting

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
From high-level model to branch-and-price solution in G12

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Optimal carpet cutting

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
ACD term rewriting

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Automatically exploiting subproblem equivalence in constraint programming

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A high level language for solver independent model manipulation and generation of hybrid solvers

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Solving RCPSP/max by lazy clause generation

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The G12 project recently started by National ICT Australia (NICTA)is an ambitious project to develop a software platform for solving large scale industrial combinatorial optimisation problems. The core design involves three languages: Zinc, Cadmium and Mercury (Group 12 of the periodic table). Zinc is a declarative modelling language for expressing problems, independent of any solving methodology. Cadmium is a mapping language for mapping Zinc models to underlying solvers and/or search strategies, including hybrid approaches. Finally, existing Mercury will be extended as a language for building extensible and hybridizable solvers. The same Zinc model, used with different Cadmium mappings, will allow us to experiment with different complete, local, or hybrid search approaches for the same problem. This talk will explain the G12 global design, the final G12 objectives, and our progress so far.