Interactive Online Configurator via Boolean Satisfiability Modeling.

Tao Tao David A. Plaisted

Published in: IAIT (2021)

Keyphrases

boolean satisfiability
product configuration
sat solvers
probabilistic planning
branch and bound algorithm
symmetry breaking
boolean optimization
sat problem
learning algorithm
np complete
constraint satisfaction problems
constraint satisfaction
randomly generated
maximum satisfiability