Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Background: Protein structure prediction and computational protein design require efficient yet sufficiently accurate descriptions of aqueous solvent. We continue to evaluate the ...
Marcel Schmidt am Busch, Anne Lopes, Najette Amara...
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
We present a generic architecture for developing fullyfledged autonomic systems out of non-autonomic components, and investigate how the architecture can be implemented using exi...
We address the problem of signal compression, basing on the mathematical model, in which a set of all possible signals is considered as a function space with a metric . The main a...