Combination of decomposability and propagation for solving first-order constraints in decomposable theories.
Khalil DjelloulPublished in: SAC (2008)
Keyphrases
- linear programming problems
- integer program
- constrained problems
- theory revision
- constraint problems
- np complete
- first order logic
- reducing the search space
- markov networks
- finite domain
- combinatorial optimization
- constraint satisfaction
- higher order
- solving constraint satisfaction problems
- lagrange multipliers
- configuration problems
- quantifier free
- dynamic constraint satisfaction problems
- constraint solver
- constraint solving
- neural network
- resource constraints
- constraint satisfaction problems
- probabilistic model
- knowledge base