Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
Few works are available in the literature to define similarity criteria between First-Order Logic formulæ, where the presence of relations causes various portions of one descript...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
The work described here initially formed part of a triangulation exercise to establish the effectiveness of the Query Term Order algorithm. The methodology produced subsequently p...