Thesis AI Logic: Ruleset Complexity Analysis in a Constraint-based Product Configurator

  • Abschlussarbeit Bachelor/Master
  • Karlsruhe

Website CAS Software AG

The constraint-based product configurator CAS Merlin has to solve an NP-complete problem after every user click. Therefore, in the worst case, each click may take exponential time (in the size of the product structure) to evaluate. Considering the high complexity of the products of our customers (even the smaller ones) this leads to astronomical values. Fortunately, in most cases we are very far away from the worst case and most configuration clicks are evaluated in a fraction of a second. Nevertheless, the actual computation time may be anywhere between a few milliseconds and billions of years. The goal of this thesis is to design and implement a way to improve the upper bound, i.e., to automatically estimate the complexity of configuration clicks for a given product ruleset. This would be very useful for a modeler, that could use this information to tweak the rules of their products in order to improve the configuration performance.


Your Tasks

· Do a literature research to assemble a list of algorithms for (propositional logic) clause set complexity estimation

· Evaluate these methods and identify those that are applicable in a constraint based product configurator like Merlin

· Possibly invent and develop your own novel methods

· Implement and experimentally evaluate the applicable methods in Merlin using real-world customer data.

· Summarize the results in your thesis and/or scientific publication(s)


Your Skills

· You can find, read and understand scientific papers relevant for a given topic

· Can write performant Java code (fast running programs)

· Not being scared off by hard (NP-Hard) problems

· Communicating your ideas clearly and precisely in writing (in English)

· Creativity in approaching hard problems


Interested? Then apply directly via


To apply for this job email your details to

Recent Posts