This paper is concerned with temporal planning relying on CSP-based functional representations. These powerful representations are today mostly restricted to the use of piecewise constant functions ranging over finite domains. We are proposing here an extension that brings a significant enhancement in the expressiveness of the representation, towards handling continuous change. This extension c...

The recently developed technique for computation of piecewise quadratic Lyapunov functions is specialized to Lyapunov functions that are piecewise linear. This establishes a unified framework for computation of quadratic, piecewise quadratic, piecewise linear and polytopic Lyapunov functions. The search for a piecewise linear Lyapunov function is formulated as a linear programming problem, and ...

In this paper, we consider the metric subregularity property for a piecewise linear multifunction (with respect to a piecewise linear constraint) as well as the weak sharp minimum property for a piecewise linear constrained multiobjective optimization problem. Of these properties we pay special attention to the global ones. We first provide a result on a certain relationship between two nonnega...

Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. The computational complexity VCSPs depends on the set allowed cost functions in input. Recently, all for finite sets over domains has been classified. Many natural problems, however, cannot be formulated as domain. We initiate systematic investigation infinite-domain with piecewise linear h...