In this paper we look into the assumption of interpreting LTL over finite traces. In particular
we show that LTLf, ie, LTL under this assumption, is less expressive than what might appear …

Planning with preferences involves not only finding a plan that achieves the goal, it requires
finding a preferred plan that achieves the goal, where preferences over plans are specified …

LTLf and LDLf are well-known logics on finite traces. We review PLTLf and PLDLf, their pure-
past versions. These are interpreted backward from the end of the trace towards the …

Current work in planning with preferences assumes that user preferences are completely
specified, and aims to search for a single solution plan to satisfy these. In many real world …

In this paper we address the problem of generating preferred plans by combining the
procedural control knowledge specified by Hierarchical Task Networks (HTNs) with rich user …

Abstract Linear Temporal Logic over finite traces (LTL f) was proposed in 2013 and has
attracted increasing interest around the AI community. Though the theoretic basis for LTL f …

Automated Planning is an old area of AI that focuses on the development of techniques for
finding a plan that achieves a given goal from a given set of initial states as quickly as …

We study theoretically the length dependence of both conductance and thermopower in
metal-molecule-metal junctions made up of dithiolated oligophenylenes contacted to gold …

Over the last decade, the use of robots in production and daily life has increased. With
increasingly complex tasks and interaction in different environments including humans …

To achieve system-level properties of a multiagent system, the behavior of individual agents
should be controlled and coordinated. One way to control agents without limiting their …