WorldCat Identities

Institut d'Investigació en Intel·ligència Artificial

Overview
Works: 72 works in 91 publications in 3 languages and 179 library holdings
Genres: Periodicals  History 
Publication Timeline
.
Most widely held works by Institut d'Investigació en Intel·ligència Artificial
Transactions on data privacy( )

in English and held by 93 WorldCat member libraries worldwide

Ramon Llull: From the Ars Magna to Artificial Intelligence( Book )

2 editions published in 2011 in English and held by 4 WorldCat member libraries worldwide

Logic programming with fuzzy unification and imprecise constants : possibilistic semantics and automated deduction by Teresa Alsinet( Book )

2 editions published between 2001 and 2003 in English and held by 3 WorldCat member libraries worldwide

On the design and costruction of agent-mediated electronic institutions by Juan A Rodríguez-Aguilar( Book )

2 editions published in 2003 in English and held by 3 WorldCat member libraries worldwide

On some implication-free fragments of substructural and fuzzy logics by Ángel García-Cerdaña( Book )

1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide

On Some variants of second-order unification by Mateu Villaret i Ausellé( Book )

1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide

In this thesis we present several results about Second-Order Unification. It is well known that the Second-Order Unification Problem is in general undecidable; the frontier between its decidable and undecidable subclasses is thin and it still has not been completely defined. Our purpose is to shed some light on the Second-Order Unification problem and study some of its variants. We have mainly focused our attention on Context Unification and Linear Second-Order Unification. Roughly speaking, these problems are variants of Second-Order Unification where second-order variables are required to be linear. Context Unification was defined more than ten years ago and its decidability has been an open question since then. Here we make relevant contributions to the study of this question. The first result that we present is a simplification on these problems thanks to "curryfication". We show that the Context Unification problem can be NP-reduced to the Context Unification problem where, apart from variables, just a single binary function symbol, and first-order constants, are used. We also show that a similar result also holds for Second-Order Unification. The main result of this thesis is the definition of a non-trivial sufficient and necessary condition on the unifiers, for the decidability of Context Unification. The condition is called rank-bound conjecture in order to enforce our belief about its truthness. It lies on a non-trivial measure of terms, the rank, and claims that, whenever an instance of the Context Unification problem is satisfiable, there exists a unifier with a rank not exceeding a certain bound depending on the size of the problem. Under the assumption of this conjecture, we give a reduction of the satisfiability problem for Context Unification to the (decidable) satisfiability problem of Word Unification with regular constraints
Improved algorithms for learning Bayesian network classifiers by Jesús Cerquides( Book )

1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide

This thesis applies objective Bayesian probability theory techniques to improve Bayesian network classifiers. The main contributions are: {u2500} A parallelizable distance based discretization method that allows to extend discrete classifiers to non-discrete domains. {u2500} The concepts of qualitative influences and synergies, which allow to improve understandability of Bayesian network classifiers. {u2500} The first order and second order qualitative Bayesian classifiers, which are classifiers based on qualitative influences and synergies, with easily understandable results and with a reasonable accuracy. {u2500} INDIFFERENTNB, an improved version of the naive Bayes classifier based on the naive Bayes model, naive distributions, Bayesian model averaging and the principle of indifference that improves the quality of the probabilities of the maximum likelihood naive Bayes classifier. {u2500} STAN+BMA, a classification algorithm based on applying empirical local Bayesian model averaging to the stan (softened TAN) classifier and which improves its accuracy. {u2500} TBMATAN, a classification algorithm based on the computability of the averaging of TAN models under decomposable distributions over TANs and the principle of indifference that improves stan accuracy. {u2500} SSTBMATAN, an efficient approximation to TBMATAN which provides also improved accuracy. {u2500} MAPTAN, a classification algorihtm that computes the maximum a posteriori TAN model and improves STAN accuracy. {u2500} MAPTAN+BMA, a classification algorithm that computes the k maximum a posteriori TAN models and their relative weights efficiently and improves STAN accuracy and STAN+BMA accuracy and learning time. These results show that the joint application of Bayesian model averaging and a careful selection of the prior probability distribution over the set of models, following objective Bayesian techniques whenever it is possible, can provide significant improvements to classification algorithms
Normative regulation of open multi-agent systems by Andrés García-Camino( Book )

1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide

Esta tesis trata de la regulación del comportamiento de agentes software en sistemas multi-agente abiertos mediante lenguajes de programación basados en normas. Primero, trata la regulación de actividades aisladas proponiendo tres lenguajes de programación basados en reglas para la implementación de normas. Segundo, trata la regulación de múltiples actividades proponiendo un lenguaje de programación basado en reglas para la propagación de normas entre actividades. Tercero, trata la resolución de conflictos en las normas programadas mediante los lenguajes propuestos. Finalmente, trata el desarrollo de un sistema multi-agente abierto regulado con los lenguajes propuestos y propone una arquitectura distribuida para este fin
Electronic institutions : from specification to development by Marc Esteva( Book )

2 editions published in 2003 in English and held by 2 WorldCat member libraries worldwide

ClusDM : a multiple criteria decision making method for heterogeneous data sets by Aïda Valls Mateu( Book )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

Design and implementation of exact MAX-SAT solvers by Jordi Planes( Book )

1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide

The Propositional Satisfiability Problem (SAT) is the problem of determining whether a truth assignment satisfies a CNF formula. Nowadays, many hard combinatorial problems such as practical verification problems in hardware and software can be solved efficiently by encoding them into SAT. In this thesis, we focus on the Maximum Satisfiability Problem (MAX-SAT), an optimization version of SAT which consists of finding a truth assignment that satisfies the maximum number of clauses in a CNF formula. We also consider a variant of MAX-SAT, called weighted MAX-SAT, in which every clause is associated with a weight and the problem consists of finding a truth assignment in which the sum of weights of violated clauses is minimum. While SAT is NPcomplete and well-suited for encoding and solving decision problems, MAX-SAT and weighted MAX-SAT are NP-hard and well-suited for encoding and solving optimization problems. This thesis is concerned with the design, implementation and evaluation of exact MAX-SAT solvers based on the branch and bound scheme, with special emphasis on defining good quality lower bounds, powerful inference techniques, clever variable selection heuristics and suitable data structures
A multiagent approach to qualitative navigation in robotics by Dídac Busquets( Book )

3 editions published in 2003 in English and held by 2 WorldCat member libraries worldwide

Poolcasting an intelligent technique to customise music programmes for their audience by Claudio Baccigalupo( Book )

2 editions published in 2010 in English and held by 2 WorldCat member libraries worldwide

Poolcasting is an intelligent technique to customise musical sequences for groups of listeners. Poolcasting acts like a disc jockey, determining and delivering songs that satisfy its audience. Satisfying an entire audience is not an easy task, especially when members of the group have heterogeneous preferences and can join and leave the group at diff erent times. The approach of poolcasting consists in selecting songs iteratively, in real time, favouring those members who are less satisfied by the previous songs played. Poolcasting additionally ensures that the played sequence does not repeat the same songs or artists closely and that pairs of consecutive songs "flow" well one after the other, in a musical sense. Good disc jockeys know from expertise which songs sound well in sequence; poolcasting obtains this knowledge from the analysis of playlists shared on the Web. The more two songs occur closely in playlists, the more poolcasting considers two songs as associated, in accordance with the human experiences expressed through playlists. Combining this knowledge and the music profiles of the listeners, poolcasting autonomously generates sequences that are varied, musically smooth and fairly adapted for a particular audience. A natural application for poolcasting is automating radio programmes. Many online radios broadcast on each channel a random sequence of songs that is not aff ected by who is listening. Applying poolcasting can improve radio programmes, playing on each channel a varied, smooth and group-customised musical sequence. The integration of poolcasting into a Web radio has resulted in an innovative system called Poolcasting Web radio. Tens of people have connected to this online radio during one year providing first-hand evaluation of its social features. A set of experiments have been executed to evaluate how much the size of the group and its musical homogeneity aff ect the performance of the poolcasting technique
Approaches to map generation by means of collaborative autonomous robots by Maite López Sánchez( Book )

2 editions published between 1999 and 2000 in English and held by 2 WorldCat member libraries worldwide

Automated service negotiation between autonomous computational agents by Peyman Faratin( Book )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

Contributions to record linkage for disclosure risk assessment by Jordi Nin( Book )

1 edition published in 2009 in English and held by 2 WorldCat member libraries worldwide

Every day, a large amount of data is collected by statistical agencies. This fact combined with the growth that the Internet has experimented during the recent years makes one wonders whether its confidential data is stored and distributed in a secure way. In this framework, data protection methods have a great importance, becoming crucial to anonymize confidential attributes before releasing them in a private and secure manner. When a protection method is applied, a new and challenging problem arises. This problem is the evaluation of the privacy provided by such method. Re-identification techniques, as record linkage methods, are one of the most common techniques for evaluating the security of a protection method. This thesis applies record linkage techniques to the calculation of the disclosure risk of a protection method. The aim of this application is to evaluate the security of a protection method in a real and fair way. The main contributions are: The definition of three specific record linkage techniques for evaluating two of the most common protection methods: rank swapping and microaggregation. The definition of an empirical disclosure risk measure for microaggregation. The development of new variants of rank swapping and microaggregation resistant to record linkage methods and disclosure risk measures defined in this thesis. The study of new disclosure risk scenarios. In particular, we have developed a record linkage method which applies aggregation functions to re-identify individuals when the intruder has no access to any of the original attributes of the protected data. We have also developed a framework for the evaluation of protection methods when they are applied to time series data
Programación Declarativa by Congreso de Programación Declarativa( Book )

2 editions published in 1993 in Spanish and held by 2 WorldCat member libraries worldwide

Butlletí de l'ACIA( )

in Catalan and held by 2 WorldCat member libraries worldwide

The calculus of refinements : a formal specification model based on inclusions by Jordi Levy Díaz( Book )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

SHAM : sistema harmonitzador automàtic de melodies by Martí Cabré i Barba( Book )

1 edition published in 1996 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.80 (from 0.74 for On some im ... to 0.99 for Electronic ...)

Alternative Names
Artificial Intelligence Research Institute

Artificial Intelligence Research Institute Bellaterra

Consejo Superior de Investigaciones Científicas Institut d'Investigació en Intelligència Artificial

IIIA

IIIA-CSIC

Institut d'Investigació en Intel.ligéncia Artificial

Instituto de Investigación en Inteligencia Artificial

Institutu d'Investigación n'Intelixencia Artificial

Languages