A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems.
Christian BessiereRemi ColettaFrédéric KoricheBarry O'SullivanPublished in: ECML (2005)
Keyphrases
- version space
- constraint satisfaction problems
- np hard
- search space
- learning algorithm
- constraint satisfaction
- path consistency
- hypothesis space
- active learning
- training instances
- computational complexity
- worst case
- np complete
- support vector
- constraint programming
- binary constraints
- version spaces
- finding optimal solutions
- constraint propagation
- solution quality
- particle swarm optimization
- decision trees