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 …

LAMA is a classical planning system based on heuristic forward search. Its core feature is
the use of a pseudo-heuristic derived from landmarks, propositional formulas that must be …

Monitoring the state of currently running processes and reacting to ad-hoc situations during
runtime is a key challenge in Business Process Management (BPM). This is especially the …

We introduce an efficient method for translating planning tasks specified in the standard
PDDL formalism into a concise grounded representation that uses finite-domain state …

We generalise the interval-based relaxation to sequential numeric planning problems with
non-linear conditions and effects, and cyclic dependencies. This effectively removes all the …

Planning systems for real-world applications need the ability to handle concurrency and
numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed …

Solving real-world problems using symbolic planning often requires a simplified formulation
of the original problem, since certain subproblems cannot be represented at all or only in a …

Penetration Testing (PT) is an effective proactive security technique that simulates hacker
attacks to identify vulnerabilities in networks or systems. However, traditional PT relies on …

The performance of an algorithm often critically depends on its parameter configuration.
While a variety of automated algorithm configuration methods have been proposed to …

This paper studies novel subgoaling relaxations for automated planning with propositional
and numeric state variables. Subgoaling relaxations address one source of complexity of the …