We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
This work will present elements of Genrich Altshuller’s Theory of Inventive Problem Solving, also known as TRIZ, and use them to describe the structural patterns found in the Ga...
This poster investigates the use of theoretical benchmarks to describe the matching functions of XML retrieval systems and the properties of specificity and exhaustivity in XML r...
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....
This paper generalizes the well-known representations of fuzzy preorders and similarities according to Valverde to the graded framework of Fuzzy Class Theory (FCT). The results de...