Conf.dr. Stefan ANDREI
Universitatea Alexandru Ioan Cuza, Facultatea de Informatica
Iasi
Romania
-----------------------------------
          
Incremental Deterministic Planning
-----------------------------------
          
ABSTRACT
-----------------------------------
We present a new planning algorithm that formulates the planning
 problem as a counting satisfiability problem in which the number
of available solutions guides the planner deterministically
to its goal. In comparison with existing planners, our approach
eliminates backtracking and supports efficient incremental planners
that add additional subformulas without the need to recompute
solutions for previously provided subformulas. Our experimental
results show that our approach is competitive with existing
state-of-the-art planners that formulate the planning problem
as a satisfiability problem, then solve the satisfiability problem
using specialized off-the-shelf satisfiability solvers such
as zChaff.
          
SHORT CV
-----------------------------------
Conf. dr. Stefan Andrei este cadru didactic la Facultatea de
informatica a Universitatii "Alexandru Ioan Cuza" din Iasi. A
predat cursuri de programare (limbajele C, C++, Java si Prolog),
Constructia compilatoarelor, Limbaje formale, Navigare Internet
si Sisteme distribuite. A obtinut doctoratul in domeniul informaticii
cu teza "Procesarea paralela", sustinuta la Universitatea din
Hamburg (Germania). Este preocupat de verificarea si depanarea
sistemelor in timp real si procesarea datelor in diverse limbaje
de programare. A obtinut premiile DAAD (1997), World Bank (1998-2000)
si Singapore - MIT Alliance (2002-2005).