Trusted Autonomy

We describe how agents are the right building blocks for constructing trustworthy systems. Robust software and trusted autonomy represent the future for agent technology and software engineering

Query expansion and noise treatment for information retrieval

Most of the search engines available over the Web are based on mathematical approaches | classical techniques in the Information Retrieval area. Thereby, they are suitable for the retrieval of documents containing some or all the terms of a query, though not to retrieve the documents containing the meaning those terms were intended to express. This paper presents some advantages obtained from query expansion with WordNet and noise treatment with knowledge on top of Paraconsistent Logic. Both methods are semantically driven, allowing the retrieval of documents which do not contain any term of the original query. Noise treatment results from the combination of a smooth term comparison with knowledge about term authentication based on behaviors of features in the collection. Although query expansion recurs for every query, noise treatment is part of the indexing mechanism, causing no overhead in queries. The domain is retrieval of ontologies represented in Resource Description Framework.Eje: Agentes y Sistemas Inteligentes (ASI)Red de Universidades con Carreras en Informática (RedUNCI

Query expansion and noise treatment for information retrieval

Most of the search engines available over the Web are based on mathematical approaches | classical techniques in the Information Retrieval area. Thereby, they are suitable for the retrieval of documents containing some or all the terms of a query, though not to retrieve the documents containing the meaning those terms were intended to express. This paper presents some advantages obtained from query expansion with WordNet and noise treatment with knowledge on top of Paraconsistent Logic. Both methods are semantically driven, allowing the retrieval of documents which do not contain any term of the original query. Noise treatment results from the combination of a smooth term comparison with knowledge about term authentication based on behaviors of features in the collection. Although query expansion recurs for every query, noise treatment is part of the indexing mechanism, causing no overhead in queries. The domain is retrieval of ontologies represented in Resource Description Framework.Eje: Agentes y Sistemas Inteligentes (ASI)Red de Universidades con Carreras en Informática (RedUNCI

Autoría de documentos web dinámicos mediante ontologías y técnicas de programación por demostración

Tesis doctoral inédita leída en la Universidad Autónoma de Madrid. Escuela Politécnica Superior, Departamento de Ingeniería Informática. Fecha de lectura: 16-09-200

Structural Web Search Using a Graph-Based Discovery System

Accessing information of interest on the Internet presents a challenge to scientists and analysts, particularly if the desired information is structural in nature. Our goal is to design a structural search engine which uses the hyperlink structure of the Web, in addition to textual information, to search for sites of interest. To design a structural search engine, we use the SUBDUE graph-based discovery tool. The tool, called WebSUBDUE, is enhanced by WordNet features that allow the engine to search for synonym terms. Our search engine retrieves sites corresponding to structures formed by graph-based user queries. We demonstrate the approach on a number of structural web queries