Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
This paper considers the composition of tuples from two relations in order to derive additional tuples of one of these relations. Our purpose is to determine when the composition i...
Sampling inequalities give a precise formulation of the fact that a differentiable function cannot attain large values, if its derivatives are bounded and if it is small on a suff...
We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of ...
Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, ...