Satisfiability modulo theories scheduling software

Practical satisfiability modulo theories smt testing by joshua wang. In the past decade, smt solvers have attracted increased attention due to technological advances and industrial applications. Rotating workforce scheduling rws is an impor tant reallife personnel rostering problem that ap pears in a large number of different business areas. An introduction to satisfiability modulo theories smt solving algorithms quantifier reasoning engines optimization with maxsat bio. We briefly survey the theory of sat and smt solving, and present some of the key algorithms in the form of pseudocode. Solvers for such formulations are commonly called satisfiability modulo theories, or smt, solvers. An efficient approach for the resourceconstrained project scheduling problem conference paper pdf available january. Solvers for satisfiability modulo theories smt check the satisfiability of firstorder formulas containing operations from various theories such as the booleans, bitvectors, arithmetic, arrays. A large number of applications in these areas bene. In this paper, we propose a new exact approach to rws that exploits the recent advances onsat isability modulo theories smt. Practical satisfiability modulo theories smt solving. A tutorial on satisfiability modulo theories springerlink. Since its inception in 2003, the initiative has pursued these aims by focusing on the following concrete goals. Checking the satisfiability of logical formulas, smt solvers scale orders of magnitude beyond custom ad hoc solvers.

An efficient approach for the resourceconstrained project scheduling problem. Dtu, diku, stanford this is me a week before fixing my thesis topic. Personnel scheduling as satisfiability modulo theories. Smtlib is an international initiative aimed at facilitating research and development in satisfiability modulo theories smt. Smt solvers have a wide range of applications in hardware and software verification, extended static checking, constraint solving, planning, scheduling, test case generation, and computer security. A supporting theory of arithmetic is then required to capture the meaning of the formulas. Information security club at san jose state university.