RUIZ CORTÉS , David

The popularity of knowledge graphs has led to the development of techniques to refine them and increase their quality. One of the main refinement tasks is completion (also known as link prediction for knowledge graphs), which seeks to add missing triples to the graph, usually by classifying potential ones as true or false. While there is a wide...

Through semantic labelling we enrich structured information from sources such as HTML pages, tables, or JSON files, with labels to integrate it into a local ontology. This process involves measuring some features of the information and then nding the classes that best describe it. The problem with current techniques is that they do not model...

Intelligent systems rely on rich sources of information to make informed decisions. Using information from external sources requires establishing correspondences between the information and known information classes. This can be achieved with semantic labelling, which assigns known labels to structured information by classifying it according to...

El problema de la vivacidad y la seleccion justa surge en el contexto de los sistemas con ejecuciones no deterministas. El concepto de seleccion completamente justa sirve para garantizar que todos los elementos que se habilitan infinitamente a menudo se ejecutan infinitamente a menudo. Esta noción de selección presenta dos anomalías: la finitud...

Preference modeling constitutes an essential component for the execution of Semantic Web Service (SWS) discovery and, especially, ranking processes, providing facilities to define user requests and preferences. In this technical report we describe our proposed preference model, introducing in Section 1 the existing challenges on this topic that...

No description

Discovery tasks in the context of Semantic Web Services are generally performed using Description Logics. However, this formalism is not suited when non-functional, numerical parameters are involved in the discovery process. Furthermore, in selection tasks, where an optimization algorithm is needed, DLs are not capable of computing the optimum....

Semantic Web Services discovery is commonly a heavyweight task, which has scal ability issues when the number of services or the ontology complexity increase, because most approaches are based on Description Logics reasoning. As more com plex services become available, there is a need for solutions that improve discovery performance. Our...

There exist many available service ranking implementations, each one providing ad hoc preference models that offer different levels of expressiveness. Consequently, applying a single implementation to a particular scenario constrains the user to define preferences based on the underlying formalisms. Furthermore, preferences from different...

Semantic Web Services discovery is commonly a heavyweight task, which has scalability issues when the number of services or the ontology complexity increase, because most approaches are based on Description Logics reasoning. As a higher number of services becomes available, there is a need for solutions that improve discovery performance....

Current proposals on Semantic Web Services discovery and ranking are based on user preferences descriptions that often come with insufficient expressiveness, consequently making more difficult or even preventing the description of complex user desires. There is a lack of a general and comprehensive preference model, so discovery and...

Classical client/server interaction primitives such as remote procedure call or rendez–vous are not adequate when we need to describe the behaviour of three or more processes that need to collaborate simultaneously in order to solve a problem. Multiparty interactions are the key to describe these problems, and there are several languages...

Ranking of Semantic Web Services is usually performed based on user preferences descriptions. These descriptions are expressed in terms of an underlying logical formalism, which limits their expressiveness. Thus, there are some kind of descriptions, such as utility functions, that cannot be handled by reasoners currently being used to perform...

No description

No description