Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
Friedrich Neurauter, Aart Middeldorp, Harald Zankl
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Abstract. The RifSimp package in Maple transforms a set of differential equations to Reduced Involutive Form. This paper describes the application of RifSimp to challenging real-w...
Wenqin Zhou, David J. Jeffrey, Gregory J. Reid, Ch...
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...