Completeness of the Bounded Satisfiability Problem for Constraint LTL.
Marcello M. BersaniAchille FrigeriMatteo RossiPierluigi San PietroPublished in: RP (2011)
Keyphrases
- satisfiability problem
- temporal logic
- finite domain
- model checking
- np complete
- modal logic
- search algorithm
- linear temporal logic
- sat problem
- stochastic local search
- phase transition
- stochastic local search algorithms
- max sat
- mazurkiewicz traces
- constraint solving
- sat instances
- decision procedures
- conjunctive normal form
- belief revision
- clause learning
- presburger arithmetic
- objective function