Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans,
that is, solutions to planning problems, that transform a given state of the world to another …

Contract automata allow to formally define the behaviour of service contracts in terms of
service offers and requests, some of which are moreover optional and some of which are …

Abstract Recently, Pure-Past Temporal Logic (PPLTL) has proven highly effective in
specifying temporally extended goals in deterministic planning domains. In this paper, we …

We present an application of strategy synthesis to enforce spatial properties. This is
achieved by implementing a toolchain that enables the tools CATLib and VoxLogicA to …

We formally introduce and solve the synthesis problem for LTL goals in the case of multiple,
even contradicting, assumptions about the environment. Our solution concept is based …

Qualitative numerical planning is classical planning extended with non-negative real
variables that can be increased or decreased" qualitatively", ie, by positive indeterminate …

We are concerned with the synthesis of strategies for sequential decision-making in
nondeterministic dynamical environments where the objective is to satisfy a prescribed …

In synthesis, assumption are constraints on the environments that rule out certain
environment behaviors. A key observation is that even if we consider system with LTLf goals …

We study temporally extended goals expressed in Pure-Past LTL (PPLTL). PPLTL is
particularly interesting for expressing goals since it allows to express sophisticated tasks as …

In recent years, Machine Learning (ML) models have achieved remarkable success in
various domains. However, these models also tend to demonstrate unsafe behaviors …