Applications of MaxSAT in Automotive Configuration

We give an introduction to possible applications of MaxSAT solvers in the area of automotive (re-)configuration. Where a SAT solver merely produces the answer “unsatisfiable” when given an inconsistent set of constraints, a MaxSAT solver computes the maximum subset which can be satisfied. Hence, a MaxSAT solver can compute repair suggestions, e.g. for non-constructible vehicle orders or for inconsistent configuration constraints. We implemented different state-of-the-art MaxSAT algorithms in a uniform setting within a logic framework. We evaluate the different algorithms on (re-)configuration benchmarks generated from problem instances of the automotive industry from our collaboration with German car manufacturer BMW.

[1]  Gerhard Friedrich,et al.  (Re)configuration using Answer Set Programming , 2011, Configuration Workshop.

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

[3]  Wolfgang Küchlin,et al.  Proving Consistency Assertions for Automotive Product Data Management , 2000, Journal of Automated Reasoning.

[4]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[5]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[6]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[7]  Albert Oliveras,et al.  Practical algorithms for unsatisfiability proof and core generation in SAT solvers , 2010, AI Commun..

[8]  Joao Marques-Silva,et al.  Algorithms for Maximum Satisfiability using Unsatisfiable Cores , 2008, 2008 Design, Automation and Test in Europe.

[9]  Alexander Felfernig,et al.  Proceedings of the 16th International Configuration Workshop , 2014 .

[10]  Alexander Felfernig,et al.  An efficient diagnosis algorithm for inconsistent constraint sets , 2011, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[11]  Maria Luisa Bonet,et al.  On Solving MaxSAT Through SAT , 2009, CCIA.

[12]  Olivier Roussel,et al.  New Encodings of Pseudo-Boolean Constraints into CNF , 2009, SAT.

[13]  Eugene C. Freuder,et al.  Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.

[14]  Toby Walsh,et al.  Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .

[15]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[16]  Joao Marques-Silva.  Practical applications of Boolean Satisfiability , 2008, 2008 9th International Workshop on Discrete Event Systems.

[17]  Adrian Kügel,et al.  Improved Exact Solver for the Weighted MAX-SAT Problem , 2010, POS@SAT.