Acquiring Constraint Networks Using a SAT-based Version Space Algorithm

Abstract

Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm for acquiring constraint networks from examples of solutions and… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics