Francois Laferriere
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Francois Laferriere has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Javier Romero
University of Potsdam
1 shared publication - Jorge Fandinno
University of Nebraska Omaha
1 shared publication - Torsten Schaub
Universität Potsdam
1 shared publication - Tran Cao Son
New Mexico State University
1 shared publication
Latest Publications
- Open Access
- 24 September 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 21 (5) , 663-679
Planning with Incomplete Information in Quantified Answer Set Programming
We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planning with sensing actions and assumptions. We represent planning problems using a simple formalism where logic programs describe the transition function between states, the initial states and the goal states. For solving planning problems, we use Quantified Answer Set Programming (QASP), an extension of ASP with existential and universal quantifiers over atoms that is analogous to Quantified Boolean Formulas (QBFs). We define the language of quantified logic programs and use it to represent the solutions different variants of conformant and conditional planning. On the practical side, we present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver, and we evaluate experimentally the approach on conformant and conditional planning benchmarks.
- 24 September 2021
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 21 (5) , 663-679
Open AccessPlanning with Incomplete Information in Quantified Answer Set Programming
We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planning with sensing actions and assumptions. We represent planning problems using a simple formalism where logic programs describe the transition function between states, the initial states and the goal states. For solving planning problems, we use Quantified Answer Set Programming (QASP), an extension of ASP with existential and universal quantifiers over atoms that is analogous to Quantified Boolean Formulas (QBFs). We define the language of quantified logic programs and use it to represent the solutions different variants of conformant and conditional planning. On the practical side, we present a translation-based QASP solver that converts quantified logic programs into QBFs and then executes a QBF solver, and we evaluate experimentally the approach on conformant and conditional planning benchmarks.