Session: Breaking Barriers in Product Configuration: The Power of CNF & SAT Solvers
Modelling constraints and products effectively in complex configuration problems is a critical challenge in today’s technology landscape owing to several factors -
1.
Complex interdependencies between product components.
2.
Exponential growth of configuration options
3.
Inefficient constraint representation
Historically the Boolean Satisfiability Problem (SAT) and its Conjunctive Normal Form (CNF) representation have been extensively used to solve combinatorial problems that involves decision making under constraints. Their application to solving product configuration use cases represents a novel and groundbreaking approach, demonstrating untapped potential in this domain.
Our approach encodes different configuration options as CNF literals, where each literal represents a specific choice or attribute. These encoded options are systematically passed to the SAT solver, enabling it to determine optimal solutions that adhere to the defined constraints and relationships. The innovative use of CNF literals not only simplifies the representation of these problems but also accelerates solver performance and enhances decision-making.
This session will empower attendees with cutting-edge methods to address real-world challenges in their industries.
Bio
Results driven IT leader with over 19 years of experience in
strategizing and executing innovative technology solutions,
specializing in the e-commerce domain.