Probabilistic satisfiability and coherence checking through integer programming.
Fábio Gagliardi CozmanLucas Fargoni di IanniPublished in: Int. J. Approx. Reason. (2015)
Keyphrases
- integer programming
- np hard
- constraint programming
- network flow
- ai planning
- bayesian networks
- linear programming
- cutting plane
- production planning
- valid inequalities
- lagrangian relaxation
- np complete
- set covering
- satisfiability problem
- inference problems
- facility location
- dantzig wolfe decomposition
- transportation problem
- column generation
- integer program
- propositional logic
- set covering problem
- computational complexity
- cutting plane algorithm
- round robin tournament