Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
A description-logic based knowledge representation system is more than an inference engine for a particular description logic. A knowledge representation system must provide a num...
: The aim of this paper is to present a modelling of rowing dynamics using bond graphs and to replace it by a modelling of mixed reality rowing dynamics using Mixed Reality Bond Gr...
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...