LoCo—A Logic for Configuration Problems

In this work, we present LoCo, a fragment of classical first-order logic carefully tailored for expressing technical product configuration problems. The core feature of LoCo is that the number of components used in configurations does not have to be finitely bounded explicitly, but instead is bounded implicitly through the axioms. Computing configurations is equivalent to the task of model finding. We present the language, related algorithms, and complexity results as well as a prototypical implementation via answer set programming.

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

[2]  Krzysztof Czarnecki,et al.  Unifying Software and Product Configuration: A Research Roadmap (to appear) , 2012 .

[3]  Heribert Vollmer,et al.  LoCo - A Logic for Configuration Problems , 2012, ECAI.

[4]  W. Nutt,et al.  Constructive problem solving : a model construction approach towards configuration , 1995 .

[5]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[6]  Baris Sertkaya,et al.  On the Complexity of Computing Generators of Closed Sets , 2008, ICFCA.

[7]  Ulrich Junker,et al.  QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.

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

[9]  David Pisinger,et al.  Interactive Cost Configuration Over Decision Diagrams , 2014, J. Artif. Intell. Res..

[10]  Eugene C. Freuder,et al.  Configuration as Composite Constraint Satisfaction , 1996 .

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

[12]  Wolfgang Küchlin,et al.  Formal methods for the validation of automotive product configuration data , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[13]  Claudio L. Lucchesi,et al.  Candidate Keys for Relations , 1978, J. Comput. Syst. Sci..

[14]  Pierre Marquis,et al.  Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..

[15]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

[16]  Georg Gottlob,et al.  Introducing LoCo, a Logic for Configuration Problems , 2011, LoCoCo.

[17]  Gerhard Friedrich,et al.  (Re)configuration based on model generation , 2011, LoCoCo.

[18]  Markus Stumptner,et al.  Generative constraint-based configuration of large technical systems , 1998, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[19]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

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

[21]  Sanjay Mittal,et al.  Towards a Generic Model of Configuraton Tasks , 1989, IJCAI.

[22]  Maurizio Lenzerini,et al.  On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata , 1987, VLDB.

[23]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[24]  丁连芬.  术语“configuration——定型”解读 , 2002 .

[25]  Gernot Salzer,et al.  Computing product configurations via UML and integer linear programming , 2010 .

[26]  Daniel Mailharro,et al.  A classification and constraint-based framework for configuration , 1998, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[27]  Markus Stumptner,et al.  Consistency-Based Configuration , 1999 .

[28]  Ingo Feinerer,et al.  Efficient large-scale configuration via integer linear programming , 2013, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[29]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.

[30]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[31]  Deborah L. McGuinness,et al.  Conceptual modelling for configuration: A description logic-based approach , 1998, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

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

[33]  Daniel Sabin,et al.  Product Configuration Frameworks - A Survey , 1998, IEEE Intell. Syst..

[34]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[35]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[36]  Toni Mancini,et al.  Conditional Constraint Satisfaction: Logical Foundations and Complexity , 2007, IJCAI.

[37]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[38]  Markus Stumptner,et al.  On Solving Complex Rack Configuration Problems using CSP Methods , 2009 .

[39]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[40]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

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

[42]  Halit Oguztüzün,et al.  Global Constraints on Feature Models , 2010, CP.