Twenty-Five Years of Successful Application of Constraint Technologies at Siemens

The development of problem solvers for configuration tasks is one of the most successful and mature application areas of artificial intelligence. The provision of tailored products, services, and systems requires efficient engineering and design processes where configurators play a crucial role. Because one of the core competencies of Siemens is to provide such highly engineered and customized systems, ranging from solutions for medium-sized and small businesses up to huge industrial plants, the efficient implementation and maintenance of configurators are important goals for the success of many departments. For more than 25 years the application of constraint-based methods has proven to be a key technology in order to realize configurators at Siemens. This article summarizes the main aspects and insights we have gained looking back over this period. In particular, we highlight the main technology factors regarding knowledge representation, reasoning, and integration which were important for our achievement. Finally we describe selected key application areas where the business success vitally depends on the high productivity of configuration processes.

[1]  Mark Wallace,et al.  Practical applications of constraint programming , 2004, Constraints.

[2]  Peter J. Stuckey,et al.  MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.

[3]  Dimitri P. Bertsekas,et al.  Convex Optimization Theory , 2009 .

[4]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[5]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[6]  Alois Haselböck,et al.  Exploiting Interchangeabilities in Constraint-Satisfaction Problems , 1993, IJCAI.

[7]  Georg Gottlob,et al.  Optimization Methods for the Partner Units Problem , 2011, CPAIOR.

[8]  Eugene C. Freuder,et al.  Guest Editors' Introduction: Configuration , 1998, IEEE Intell. Syst..

[9]  Rina Dechter,et al.  Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.

[10]  Alexander Felfernig,et al.  Recommendation Technologies for Configurable Products , 2011, AI Mag..

[11]  Paul Clements,et al.  Software product lines - practices and patterns , 2001, SEI series in software engineering.

[12]  Ákos Horváth,et al.  Dynamic constraint satisfaction problems over models , 2011, Software & Systems Modeling.

[13]  Hector A. Rosales-Macedo Nonlinear Programming: Theory and Algorithms (2nd Edition) , 1993 .

[14]  Andreas A. Falkner,et al.  Modeling and solving technical product configuration problems , 2011, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[15]  Christian Bessiere,et al.  Constraint Propagation , 2006, Handbook of Constraint Programming.

[16]  Eugene C. Freuder,et al.  Stable Solutions for Dynamic Constraint Satisfaction Problems , 1998, CP.

[17]  Eugene C. Freuder Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[18]  Deepak Dhungana,et al.  Generation of conjoint domain models for system-of-systems , 2014, GPCE '13.

[19]  Markus Stumptner,et al.  Configuring Large Systems Using Generative Constraint Satisfaction , 1998, IEEE Intell. Syst..

[20]  Kyo Chul Kang,et al.  Feature-Oriented Domain Analysis (FODA) Feasibility Study , 1990 .

[21]  Barry O'Sullivan,et al.  Constraint Programming and Combinatorial Optimisation in Numberjack , 2010, CPAIOR.

[22]  Rolf H. Möhring,et al.  Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems , 2009, Robust and Online Large-Scale Optimization.

[23]  Michael Gelfond,et al.  Answer Sets , 2008, Handbook of Knowledge Representation.

[24]  Domenico Beneventano,et al.  Consistency Checking in Complex Object Database Schemata with Integrity Constraints , 1995, DBPL.

[25]  Roger King,et al.  Semantic database modeling: survey, applications, and research issues , 1987, CSUR.

[26]  Peter J. Stuckey,et al.  Modelling with Option Types in MiniZinc , 2014, CPAIOR.

[27]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

[28]  Sergio Segura,et al.  Automated analysis of feature models 20 years later: A literature review , 2010, Inf. Syst..

[29]  Elliot Soloway,et al.  Assessing the Maintainability of XCON-in-RIME: Coping with the Problems of a VERY Large Rule-Base , 1987, AAAI.

[30]  Pascal Van Hentenryck,et al.  Numerica: A Modeling Language for Global Optimization , 1997, IJCAI.

[31]  Thomas Schiex,et al.  Soft Constraints , 2000, WLP.

[32]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[33]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[34]  John P. McDermott,et al.  R1: A Rule-Based Configurer of Computer Systems , 1982, Artif. Intell..

[35]  Ian P. Gent,et al.  Symmetry in Constraint Programming , 2006, Handbook of Constraint Programming.

[36]  Peter van Beek,et al.  Backtracking Search Algorithms , 2006, Handbook of Constraint Programming.

[37]  Leonardo Mendonça de Moura Orchestrating Satisfiability Engines , 2011, CP.