Differences

This shows you the differences between two versions of the page.

--- software [2025/01/13 11:03] – admin
+++ software [2025/01/13 11:08] (current) – [SibylSAT Planner] admin
@@ Line 1: / Line 1: @@
 ====== Software ======
+~~NOTOC~~
 ===== PDDL4J v4.0 =====
@@ Line 6: / Line 8: @@
 **[[http://pddl4j.imag.fr|PDDL4J v4.0]]** (Planning Domain Description Language for Java is a software library under LGPL license embedding Artificial Intelligence algorithms to find solutions for planning problems, that is to say time organized actions to achieve a goal. Solutions to planning problems are “todo lists” named plan representing operational features of actions like who, how, where, when and what to do. The code of the library is available on [[https://github.com/pellierd/pddl4j|GitHub]]. More details are available in :
-   * D. Pellier & H. Fiorino (2017) PDDL4J: a planning domain description library for java, Journal of Experimental & Theoretical Artificial Intelligence, 30:1, 143-176, [[https://hal.science/hal-04728835v1|DOI: 10.1080/0952813X.2017.1409278]]
+   * D. Pellier & H. Fiorino (2017) [[https://hal.science/hal-04728835v1|PDDL4J: a planning domain description library for Java]], Journal of Experimental & Theoretical Artificial Intelligence, 30:1, 143-176
 ###
@@ Line 12: / Line 14: @@
 ===== SibylSAT Planner =====
-**[[https://github.com/gaspard-quenard/sibylsat|SibylSat]]** is an incremental SAT-based planner for totally-ordered HTN planning problems based on a fork of the Lilotane planner. Like lilotane and other current SAT-based solver, SibylSat adheres to a standard procedure of alternating between expanding the search space, encoding it into a SAT formula, and invoking a SAT solver to find a solution plan. However, it differ from the other SAT-based planner in that it uses a greedy best first search to explore the search space instead of the usual breadth-first search.
+###
-  ** Paper:
+**[[https://github.com/gaspard-quenard/sibylsat|SibylSat]]** is an incremental SAT-based planner for totally-ordered HTN planning problems based on a fork of the Lilotane planner. Like lilotane and other current SAT-based solver, SibylSat adheres to a standard procedure of alternating between expanding the search space, encoding it into a SAT formula, and invoking a SAT solver to find a solution plan. However, it differ from the other SAT-based planner in that it uses a greedy best first search to explore the search space instead of the usual breadth-first search.
+  * Gaspard Quenard, Damien Pellier, Humbert Fiorino: [[https://cnrs.hal.science/LIG_SIC_MARVIN/hal-04764696v1|SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning]]. ECAI 2024: 4157-4164
 ###