Skip to Main content Skip to Navigation
Conference papers

TouIST: a Friendly Language for Propositional Logic and More

Abstract : 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 and to benefit from the regular improvements of SAT, QBF or SMT solvers in order to solve these problems efficiently. In particular, we show how to use TouIST to solve different classes of planning tasks in Artificial Intelligence.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download
Contributor : Dominique Longin <>
Submitted on : Monday, August 31, 2020 - 9:57:16 AM
Last modification on : Thursday, December 17, 2020 - 2:18:02 PM
Long-term archiving on: : Tuesday, December 1, 2020 - 12:11:33 PM


Files produced by the author(s)



Jorge Fernandez, Olivier Gasquet, Andreas Herzig, Dominique Longin, Emiliano Lorini, et al.. TouIST: a Friendly Language for Propositional Logic and More. Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence , Jul 2020, Yokohama, Japan. pp.5240-5242, ⟨10.24963/ijcai.2020/756⟩. ⟨hal-02925894⟩



Record views


Files downloads