The problem of inland freight planning from the perspective of a medium size transport company operating in the EU market is studied. The authors embark on a path to put Information Technologies to work in order to reduce manual overhead and facilitate decision-making within this domain by algorithmically approximating the potential profitability of freight offers based on multiple criteria and shortlisting the most promising offers. Following the Design Science Research approach, the Proof of Concept of IT-enabled decision support solution for logistics companies is delivered and validated. Several strategies for choosing an offer among many for a truck with a given spatio-temporal location are investigated and compared.

We introduce a substructural modal logic of utility that can be used to reason aboutoptimality with respect to properties of states. Our notion of state is quite general, and is able to represent resource allocation problems in distributed systems. The underlying logic is a variant of the modal logic of bunched implications, and based on resource semantics, which is closely related to concurrent separation logic. We consider a labelled transition semantics and establish conditions under which Hennessy—Milner soundness and completeness hold. By considering notions of cost, strategy and utility, we are able to formulate characterizations of Pareto optimality, best responses, and Nash equilibrium within resource semantics. We also show that our logic is able to serve as a logic for a fully featured process algebra and explain the interaction between utility and the structure of processes.

The paper presents an approach to knowledge integration coming from different databases. It is based on model tree construction from databases with both discrete and continuous attributes. The methodology of model trees is explained. Some information on implementation issues is given and preliminary results on a real dataset are presented.

The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equalizers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. The main positive result of the paper states that reachable Petri nets with multiplicative morphisms form a finitely complete category. As an application of this result, some well-known categories are shown to be finitely complete. For instance, since all morphisms between reachable safe Petri nets are multiplicative, it follows that the category of reachable safe Petri nets is finitely complete.