, Nous donnons figure 3.5 le plan solution retourné par TouISTPlan en utilisant le codage SAT que nous avons présenté dans la sous-section 3.1.2. La lecture du plan s'effectue de manière linéaire en suivant les flèches d'une étape à l'autre. PICK(ball2,rooma

, MOVE(rooma,room b )

, DROP

, MOVE(room b ,rooma) PICK(ball7,rooma,lef t) PICK(ball6,rooma,right)

, MOVE(rooma,room b )

, DROP(ball6,room b ,right) DROP(ball7,room b

, MOVE(room b ,rooma) PICK(ball1,rooma,right) PICK(ball5,rooma

, MOVE(rooma,room b )

, DROP

, MOVE(room b ,rooma) PICK(ball4,rooma

, MOVE(rooma,room b )

, DROP

A. A. Touist and . Manual-|-<connectors,

=. =="-<t>-<order and ;. >=,

, Elements can be integers, floats, propositions, booleans, quoted formulas or sets (or a variable of these six types). The empty set ? is denoted by

,. .. , Ranges can be produced with both integer and float limits. For both integer and float limits, the step is 1 (respectively 1.0)

, Set-builder notation

×. , A set-builder expression is a set defined as {p(x 1

. .. ×-s-n-}-;, which is the set of expressions based on the cartesian product of the sets S 1

, List comprehension allows you to generate sets containing any expression : numbers, propositions and even formulas. In order to use formulas, you must use the quoted notation (see Section A.1.7). The when keyword helps filter the generated elements

, $j) end Newline-and As mentioned in a note (first section), in top-level, a new line (or any kind of white spaces) separating two formulas will be translated into a lesser-priority and

|. &lt;t&gt;, <T> <-newline/whitespace in top-level is an 'and

, Using the --qbf and --solve flags (in touist) or the QBF selector (in the graphical interface), you can solve QBF problems with existential and universal quantifiers over boolean values. This logic is basically the same as the SAT grammar, except for two new operators ? (exists) and ? (forall) : <formula-qbf>, The TouIST language accepts Quantified Boolean Formulas (QBF)

, <formula-qbf> | "forall" <comma-list(<prop>|<var>)> [<for>] ":" <formula-qbf> <for> ::= "for" <var> "in" <set> A.1. LANGUAGE REFERENCE <prop> ::= | <var> | TERM | TERM "(" <comma-list(<expr>)> ")" <assign> ::= <var> "=" (<expr>) <let-assign<T>> ::= | "let" <var> "=" <expr> ":" <formula<T>> | "let" <comma-list(<var>)> "=" <comma-list(<expr>)> ":" <formula<T>> <equality(<T>)> ::= | <T> "!=" <T> | <T> "==" <T> <order(<T>)> ::= | <T> ">" <T> | <T> "<" <T> | <T> "<=" <T> | <T> ">=" <T> <bool> ::= "

. |-&quot;empty, | <equality

|. &lt;order,

|. &lt;connectors,

=. &lt;t&gt;,

|. &lt;t&gt;-&quot;*&quot;-&lt;t&gt;,

|. &lt;t&gt;-&quot;, /" <T> <num-operation-others(<T>)> ::= | <T> "mod" <T> | "abs, <T> ")" <int> ::= ANNEXE A. TOUIST REFERENCE MANUAL

, | num-operation-others(<int>)

|. Card, <float> ::= | "(" <float> ")" | <var> | FLOAT | num-operation

, | num-operation-others(<float>)

. |-&quot;sqrt,

|. &lt;set&gt;,

, | "union(" <set>

|. Inter,

. |-&quot;diff,

|. Powerset, <comma-list(<T>)> <generalized-connectors(<T>)> ::= | "bigand" <comma-list(<var>)> "in" <comma-list(<set>)>

, bigor" <comma-list(<var>)> "in" <comma-list(<set>)> ["when" <bool>

. |-&quot;exact,

A. Blum and M. Furst, « Fast planning through planning-graphs analysis, Proc. IJCAI-95, pp.1636-1642, 1995.

A. Blum and M. Furst, « Fast planning through planning-graphs analysis, Artificial Intelligence, vol.90, issue.2, pp.281-300, 1997.

B. Clark, F. Pascal, and T. Cesare, The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org, 2016.

B. Philippe, A. Herzig, and N. T. , Dynamic Logic of Propositional Assignments : A Well-Behaved Variant of PDL, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, pp.143-152, 2013.

B. Armin, . Resolve, and ». Expand, Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing

, SAT'04, pp.59-70, 2005.

B. Armin, . Resolve, and ». Expand, Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing

, SAT'04, pp.59-70, 2005.

D. Le, B. Et-anne, and P. , « The Sat4j library, release 2.2, pp.59-65, 2010.

T. B. , The Computational Complexity of Propositional STRIPS Planning, Artificial Intelligence, vol.69, issue.94, pp.90081-90088, 1994.

M. Cashmore, « Planning as quantified Boolean formulae, 2013.

M. Cashmore, M. Fox, and E. Giunchiglia, « Planning as Quantified Boolean Formula, ECAI 2012, pp.217-222, 2012.

D. C. , Planning for conjunctive goals, Artificial Intelligence, vol.32, pp.333-377, 1987.

E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, « Counterexampleguided abstraction refinement for symbolic model checking, J. ACM, vol.50, pp.752-794, 2003.

M. C. Cooper, M. Frederic, and R. Pierre, « Managing Temporal cycles in Planning Problems Requiring Concurrency, Computational Intelligence, vol.29, pp.111-128, 2013.

A. Stephen and . Cook, Sous la dir, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp.151-158, 1971.

M. B. Do and S. K. , Planning as constraint satisfaction : Solving the planning graph by compiling it into CSP, Artificial Intelligence, vol.132, pp.151-182, 2001.

D. Bruno and . Yices, Computer-Aided Verification (CAV'2014)

. Sous-la-dir.-d&apos;armin, . Biere, and B. T. Roderick, Lecture Notes in Computer Science, pp.737-744, 2014.

M. Ernst, T. Millstein, and D. S. Weld, « Automatic SAT-compilation of planning problems, IJCAI 97, 1997.

F. Maria, L. Derek, and H. Keith, Sous la dir. de Ramon López de MÁNTARAS et Lorenza SAITTA, Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, vol.1, pp.1-58603, 2004.

G. Olivier, L. Dominique, M. Frédéric, R. Pierre, and V. Maël, « Compact Tree Encodings for Planning as QBF, Inteligencia Artificial, vol.21, pp.1988-3064, 2018.

G. Malik, D. S. Nau, and T. Paolo, Automated planningtheory and practice, pp.978-979, 2004.

G. Olivier, S. François, and S. Martin,

«. Satoulouse, The Computational Power of Propositional Logic Shown to Beginners, Tools for Teaching Logic : Third International Congress, 2011.

B. Patrick, . Hans-van-ditmarsch, M. María, S. Fernando, and . Berlin, , pp.77-84, 2011.

M. Janota, W. Klieber, J. Marques-silva, and E. M. Clarke, « Solving QBF with Counterexample Guided Refinement, SAT 2012

M. Janota, W. Klieber, J. Marques-silva, and E. M. Clarke, « Solving QBF with counterexample guided refinement, Artificial Intelligence, vol.234, pp.1-25, 2016.

M. Janota and J. Marques-silva, « Solving QBF by Clause Selection, IJCAI 2015

H. K. Satplan04, Planning as Satisfiability, International Planning Competition, IPC-04, 2004.

H. Kautz, D. Mcallester, and B. Selman, « Encoding plans in propositional logic, Proc. KR-96, pp.374-384, 1996.

. Bibliographie,

K. Daniel and S. Ofer, Decision Procedures -An Algorithmic Point of View, Second Edition, An EATCS Series, 2016.

H. Kautz and B. Selman, « Planning as satisfiability, ECAI 1992, pp.359-363, 1992.

S. Kambhampati and B. Srivastava, Universal Classical Planner : An Algorithm for Unifying State-space and Plan-space Planning, Proc

. Ewsp-95, , pp.93-94, 1995.

H. Kautz and B. Selman, Pushing the envelope : Planning, propositional logic and stochastic search, AAAI 1996, pp.1194-1201, 1996.

H. Kautz, B. Selman, and . Blackbox, A New Approach to the Application of Theorem Proving to Problem Solving, AIPS-98 Workshop on Planning as Combinatorial Search, 1998.

H. Kautz and B. Selman, « Unifying SAT-based and Graph-based planning, IJCAI 1999, pp.318-325, 1999.

H. Kautz, B. Selman, and J. Hoffmann, International Planning Competition, IPC-06, 2006.

F. Lonsing and U. Egly, « DepQBF 6.0 : A Search-Based QBF Solver Beyond Traditional QCDCL, CADE 26 -International Conference on Automated Deduction, 2017.

M. Drew, PDDL -The Planning Domain Definition Language

. Rapp, , 1998.

A. Mali and S. Kambhampati, « Refinement-based planning as satisfiability, AIPS-98 Workshop on Planning as Combinatorial Search, 1998.

A. Mali and S. K. , On the utility of plan-space (causal) encodings, AAAI 1999, pp.557-563, 1999.

M. Frederic, R. «. Pierre, and . Tlp-gp, 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), vol.1, pp.507-514, 2008.

,

N. Robert, O. Albert, and T. Cesare, Solving SAT and SAT Modulo Theories : From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T), vol.53, pp.937-977, 2006.

J. Rintanen, K. Heljanko, and . Niemelä, « Parallel encodings of classical planning as satisfiability, JELIA 2004, 2004.

J. Rintanen, K. Heljanko, and N. , Planning as satisfiability : parallel plans and algorithms for plan search, Artificial Intelligence, vol.170, pp.1031-1080, 2006.

J. Rintanen, « Discretization of Temporal Models with Application to Planning with SMT, AAAI 2015

J. Rintanen, « Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae

J. Rintanen, B. Nebel, J. C. Beck, and E. A. Hansen, Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS, pp.978-979, 2008.

J. Rintanen, « Symmetry reduction for SAT representations of transition systems, ICAPS 2003, 2003.

J. Rintanen, « Asymptotically Optimal Encodings of Conformant Planning in QBF, AAAI 2007, pp.1045-1050, 2007.

M. N. Rabe, L. «. Tentrup, Q. Caqe-:-a-certifying, and . Solver, FMCAD 2015

J. Shin and E. Davis, Processes and continuous change in a SAT-based planner, vol.166, p.10, 2005.

,

S. Niklas and E. Niklas, MiniSat v1.13 -A SAT solver with conflict-clause minimization (SAT-2005), 2002.

. Bibliographie,

L. J. Stockmeyer and A. R. Meyer, Proceedings of the Fifth Annual ACM Symposium on Theory of Computing. STOC '73, pp.1-9, 1973.

S. A. Wolfman and D. S. Weld, « The LPSAT Engine & Its Application to Resource Planning, IJCAI 1999, pp.310-317, 1999.