favorite2But in order to solve several generic planning problems, we can take advantage from the flexibility of TouIST which will allow the user to describe a generic solving method with rules encoded as formulas and to use domains sets to describe each particular planning problem.
favorite8Last, extension to richer theories is also something that may interest researchers, engineers or graduate students, since SAToulouse is definitely not suited for satisfiability modulo theories or for solving planification problems though the same architecture of the software could be used by just changing the solver used.
favorite29It can interact with various provers: pure SAT solver but also SMT provers (SAT modulo theories - like linear theory of reals, etc) and thus may also be used by beginners for experiencing with pure propositional problems up to graduate students or even researchers for solving planification problems involving big sets of fluents and numerical constraints on them.
favorite32Abstract SAT provers are powerful tools for solving real-sized logic problems, but using them requires solid programming knowledge and may be seen w.r.t. Something like a high level language was missing to ease various users to take benefit of these tools.
favorite9Twist your logic with TouIST Skander Ben Slimane1 , Alexis Comte1 , Olivier Gasquet1 , Abdelwahab Heba1 , Olivier Lezaud1 , Frederic Maris1 , and Mael Valais1 1.