Conflict Handling in Product Configuration using Answer Set Programming


Herud K., Baumeister J., Sabuncu O., Schaub T.

38th International Conference on Logic Programming Workshops, ICLP Workshops 2022, Haifa, İsrail, 31 Temmuz - 01 Ağustos 2022, cilt.3193 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 3193
  • Basıldığı Şehir: Haifa
  • Basıldığı Ülke: İsrail
  • Anahtar Kelimeler: Answer Set Programming, Conflict Explanation, Conflict Resolution, Minimally Unsatisfiable Subsets, Product Configuration
  • TED Üniversitesi Adresli: Evet

Özet

© 2022 Copyright for this paper by its authors.Product configuration is one of the most important industrial applications of artificial intelligence. In order to enable customers to individualize complex products, usually logical configuration models are necessary. One challenge that exists here is the communication of product knowledge to the customer. This work deals with the situation of invalid customer requirements under given logical constraints. The goal is to explain why configurations are invalid and how they can be minimally changed to become valid again. This involves computing all minimal subsets of both constraints and requirements that make the configuration unsatisfiable. For this, we present a novel approach based on the declarative paradigm of Answer Set Programming. We empirically demonstrate its suitability for real-time configurators with thousands of features and constraints. The approach thus fills the gap of an easy-to-implement as well as high-performing conflict resolution component.