We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
Web-based applications are typically required to be highly customizable and configurable. New application requirements have to be introduced rapidly, often without stopping the ru...
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...