TouIST, a Teacher-and Student-Friendly Language for Propositional Logic and Discrete Mathematics
Résumé
This work deals with logical formalization and problem solving using automated solvers. We present the automatic translator TouIST that provides a simple language to generate logical formulas from a problem description. Our tool allows us to model many static or dynamic combinatorial problems. All this can be very helpful as a teaching support for logics and discrete mathematics. Users will benefit from the regular improvements of SAT, QBF or SMT solvers in order to solve concrete logical and combinatorial problems efficiently, e.g., different classes of planning tasks in Artificial Intelligence.
Fichier principal
TouIST__Teacher__and_Student_Friendly_Language_for_Propositional_Logic_and_Discrete_Mathematics__Version_longue_.pdf (252.54 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|