This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
User-centered consultation systems can be viewed as systems with trust in the competence of the user, whereas conventional knowledge systems are often based on some mistrust. By o...
Georg Buscher, Joachim Baumeister, Frank Puppe, Di...