{"type":"ScholarlyArticle","title":"TouIST: a Friendly Language for Propositional Logic and More","authors":[{"name":"Jorge Fernandez","slug":"jorge-fernandez","given":"Jorge","family":"Fernandez","affiliation":"IRIT -Univ. Paul Sabatier , Toulouse"},{"name":"Olivier Gasquet","slug":"olivier-gasquet","given":"Olivier","family":"Gasquet","affiliation":"IRIT -Univ. Paul Sabatier , Toulouse"},{"name":"Andreas Herzig","slug":"andreas-herzig","given":"Andreas","family":"Herzig","affiliation":"IRIT -CNRS , Toulouse"},{"name":"Dominique Longin","slug":"dominique-longin","given":"Dominique","family":"Longin","affiliation":"IRIT -CNRS , Toulouse"},{"name":"Emiliano Lorini","slug":"emiliano-lorini","given":"Emiliano","family":"Lorini","affiliation":"IRIT -CNRS , Toulouse"},{"name":"Frédéric Maris","slug":"frederic-maris","given":"Frédéric","family":"Maris","affiliation":"IRIT -Univ. Paul Sabatier , Toulouse"},{"name":"Pierre Régnier","slug":"pierre-regnier","given":"Pierre","family":"Régnier","affiliation":"IRIT -Univ. Paul Sabatier , Toulouse"}],"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.","doi":"10.24963/ijcai.2020/756","url":"https://ijcai.org/proceedings/2020/756","pdf":"https://ijcai.org/proceedings/2020/0756.pdf","markdown":"https://ijcai.org/proceedings/2020/756.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/756","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Demos","track":"Demos","number":756,"pages":{"first":5240,"last":5242},"keywords":["Planning and Scheduling: general","Constraints and Satisfiability: general"],"videos":[],"references":[{"position":1,"raw":"[Barwise, 1981] Jon Barwise. Scenes and other situations. Journal of Philosophy, 78(7):369-397, 1981.","title":"Jon Barwise. Scenes and other situations","authors":"Barwise","year":"1981","venue":"Journal of Philosophy","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Biere, 2005] Armin Biere. Resolve and expand. In Pro- ceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, SAT'04, pages 59-70, Berlin, Heidelberg, 2005. Springer-Verlag.","title":"Resolve and expand","authors":"Armin Biere, Biere","year":"2005","venue":"Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, SAT'04","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cashmore et al., 2012] Michael Cashmore, Maria Fox, and Enrico Giunchiglia. Planning as quantified boolean for- mula. In ECAI 2012 -20th European Conference on Ar- tificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012, pages 217-222, 2012.","title":"Planning as quantified boolean formula","authors":"Michael Cashmore, Maria Fox, Enrico Giunchiglia","year":"2012","venue":"ECAI 2012 -20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ernst et al., 1997] Michael D. Ernst, Todd D. Millstein, and Daniel S. Weld. Automatic sat-compilation of plan- ning problems. In Proceedings of the Fifteenth Interna- tional Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, 2 Volumes, pages 1169-1177, 1997.","title":"Automatic sat-compilation of planning problems","authors":"D Michael, Todd D Ernst, Daniel S Millstein, Weld","year":"1997","venue":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97","doi":null,"url":null,"internal_url":"/proceedings/1997/169"},{"position":5,"raw":"[Gasquet et al., 2018] Olivier Gasquet, Dominique Longin, Frederic Maris, Pierre Régnier, and Maël Valais. Com- pact tree encodings for planning as QBF. Inteligencia Ar- tificial, Revista Iberoamericana de Inteligencia Artificial, 21(62):103-114, 2018.","title":"Compact tree encodings for planning as QBF. Inteligencia Artificial","authors":"Olivier Gasquet, Dominique Longin, Frederic Maris, Pierre Régnier, Maël Valais","year":"2018","venue":"Revista Iberoamericana de Inteligencia Artificial","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Kautz and Selman, 1992] Henry A. Kautz and Bart Selman. Planning as satisfiability. In 10th European Conference on Artificial Intelligence, ECAI 92, Vienna, Austria, August 3-7, 1992. Proceedings, pages 359-363, 1992.","title":"Planning as satisfiability","authors":"Henry A Kautz, Bart Selman","year":"1992","venue":"10th European Conference on Artificial Intelligence, ECAI 92","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Kautz and Selman, 1996] Henry A. Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic and stochastic search. In Proceedings of the Thirteenth Na- tional Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Confer- ence, AAAI 96, IAAI 96, Portland, Oregon, USA, August 4-8, 1996, Volume 2, pages 1194-1201, 1996.","title":"Pushing the envelope: Planning, propositional logic and stochastic search","authors":"Henry A Kautz, Bart Selman","year":"1996","venue":"Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 96, IAAI 96","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Kroening and Strichman, 2016] Daniel Kroening and Ofer Strichman. Decision Procedures -An Algorithmic Point of View, Second Edition. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2016.","title":"Decision Procedures -An Algorithmic Point of View","authors":"Strichman Kroening, Daniel Kroening, Ofer Strichman","year":"2016","venue":"Texts in Theoretical Computer Science. An EATCS Series","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Mali and Kambhampati, 1999] Amol Dattatraya Mali and Subbarao Kambhampati. On the utility of plan-space (causal) encodings. In Proceedings of the Sixteenth Na- tional Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intel- ligence, July 18-22, 1999, Orlando, Florida, USA, pages 557-563, 1999.","title":"On the utility of plan-space (causal) encodings","authors":"Amol Dattatraya, Mali, Subbarao Kambhampati","year":"1999","venue":"Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Maris and Régnier, 2008] Frederic Maris and Pierre Régnier. TLP-GP: new results on temporally-expressive planning benchmarks. In 20th IEEE International Con- ference on Tools with Artificial Intelligence (ICTAI 2008), November 3-5, 2008, Dayton, Ohio, USA, Volume 1, pages 507-514, 2008.","title":"TLP-GP: new results on temporally-expressive planning benchmarks","authors":"Maris, Régnier, Frederic Maris, Pierre Régnier","year":"2008","venue":"20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Rintanen et al., 2006] Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell., 170(12- 13):1031-1080, 2006.","title":"Planning as satisfiability: parallel plans and algorithms for plan search","authors":"Rintanen","year":"2006","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Rintanen, 2007] Jussi Rintanen. Asymptotically optimal en- codings of conformant planning in QBF. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intel- ligence, July 22-26, 2007, Vancouver, British Columbia, Canada, pages 1045-1050, 2007.","title":"Asymptotically optimal encodings of conformant planning in QBF","authors":"Jussi Rintanen","year":"2007","venue":"Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Rintanen, 2015] Jussi Rintanen. Discretization of tempo- ral models with application to planning with SMT. In Proceedings of the Twenty-Ninth AAAI Conference on Ar- tificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 3349-3355, 2015.","title":"Jussi Rintanen. Discretization of temporal models with application to planning with SMT","authors":"Rintanen","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Shin and Davis, 2005] Ji-Ae Shin and Ernest Davis. Pro- cesses and continuous change in a sat-based planner. Artif. Intell., 166(1-2):194-253, 2005.","title":"Ji-Ae Shin and Ernest Davis. Processes and continuous change in a sat-based planner","authors":"Davis Shin","year":"2005","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}