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.
Cite
Text
Fernandez et al. "TouIST: A Friendly Language for Propositional Logic and More." International Joint Conference on Artificial Intelligence, 2020. doi:10.24963/IJCAI.2020/756Markdown
[Fernandez et al. "TouIST: A Friendly Language for Propositional Logic and More." International Joint Conference on Artificial Intelligence, 2020.](https://mlanthology.org/ijcai/2020/fernandez2020ijcai-touist/) doi:10.24963/IJCAI.2020/756BibTeX
@inproceedings{fernandez2020ijcai-touist,
title = {{TouIST: A Friendly Language for Propositional Logic and More}},
author = {Fernandez, Jorge and Gasquet, Olivier and Herzig, Andreas and Longin, Dominique and Lorini, Emiliano and Maris, Frédéric and Régnier, Pierre},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2020},
pages = {5240-5242},
doi = {10.24963/IJCAI.2020/756},
url = {https://mlanthology.org/ijcai/2020/fernandez2020ijcai-touist/}
}