Lars Karlsson

Learn More
Techniques and algorithms for efficient in-place conversion to and from standard and blocked matrix storage formats are described. Such functionality is required by numerical libraries that use different data layouts internally. Parallel algorithms and a software package for in-place matrix storage format conversion based on in-place matrix transposition(More)
In this article, we describe a possibilistic/probabilistic conditional planner called PTLplan. Being inspired by Bacchus and Kabanza’s TLplan, PTLplan is a progressive planner that uses strategic knowledge encoded in a temporal logic to reduce its search space. Actions effects and sensing can be context dependent and uncertain, and the information the(More)
The combination of task and motion planning presents us with a new problem that we call geometric backtracking. This problem arises from the fact that a single symbolic state or action may be geometrically instantiated in infinitely many ways. When a symbolic action cannot be geometrically validated, we may need to backtrack in the space of geometric(More)
Situation Calculus is probably the most widely studied and used formalismfor reasoning about action and change. The main reason for its popularity is the ability to reason about diier-ent courses of actions on the object level. In particular, planning can be formulated as an existence problem. This paper shows how these properties break down when incomplete(More)
This paper presents the sensor network infrastructure for a home care system that allows long-term monitoring of physiological data and everyday activities. The aim of the proposed system is to allow the elderly to live longer in their home without compromising safety and ensuring the detection of health problems. The system offers the possibility of a(More)
In this paper we introduce regression-based pre-and postdiction procedures for PMON, a nonmonotonic logic for action and change with explicit time. We also provide an in depth analysis of problems with regression that occur when nondeterministic actions are introduced. We do this by employing Dijkstra's weakest liberal precondition operator, wlp. The(More)