Ineractive Scheduling as a Constraint Satisfiability Problem.
Ronen FeldmanMartin Charles GolumbicPublished in: Ann. Math. Artif. Intell. (1990)
Keyphrases
- satisfiability problem
- finite domain
- np complete
- search algorithm
- temporal logic
- resource constraints
- phase transition
- scheduling problem
- sat problem
- stochastic local search
- sat instances
- pspace complete
- stochastic local search algorithms
- max sat
- conjunctive normal form
- constraint solving
- decision procedures
- linear constraints
- mazurkiewicz traces