Lagrangian Method for Satisfiability Problems of Propositional Calculus.
Masahiro NagamatuTorao YanaruPublished in: ANNES (1995)
Keyphrases
- satisfiability problem
- propositional calculus
- lagrangian method
- np complete
- search algorithm
- temporal logic
- sat problem
- phase transition
- lagrange multipliers
- pspace complete
- genetic algorithm
- stochastic local search
- solving hard
- max sat
- constraint satisfaction
- constrained optimization
- davis putnam
- multiple input multiple output
- special case