We present new complexity results on answer set checking for non-ground programs under a variety of syntactic restrictions. For several of these problems, the kind of representation of the answer set to be checked is important. In particular, we consider setbased and bitmap-based representations, which are popular in implementations of Answer Set Programming systems. Furthermore, we present new...

We study the set of possible joint posterior belief distributions a group agents who share common prior regarding binary state and observe some information structure. For two agents, ...

We consider the problem of computing the complete answer to a query when there is limited access to relations, i.e., when binding patterns require values to be speciied for certain attributes in order to retrieve data from a relation. This problem is common in information-integration systems, where heterogeneous sources have diverse and limited query capabilities. A query is stable if for any i...

When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing requirements are not violated. A possible way of composing applications is through the resource reservation approach. Each application is handled by a dedicated server that is assigned a fraction of the processor. Using t...

It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least one of these problems is feasible. It is also well known that for linear conic problems this property of “no duality gap” may not hold. It is then natural to ask whether there exist some other convex closed cones, apart from polyhedral, for which the “no duality gap” propert...

In recent years the multi-core era started to affect embedded systems, changing some of the rules: While on a single processor, Earliest Deadline First has been proven to be the best algorithm to guarantee the correct execution of priorized tasks, Dhall et al. have shown that this approach is not feasible for multi-processor systems anymore. A variety of new scheduling algorithms has been intro...