Martine De Cock

Answer set programming (ASP) is a declarative language tailored towards solving combinatorial optimization problems. It has been successfully applied to e.g. planning problems, configuration and verification of software, diagnosis and database repairs. However, ASP is not directly suitable for modeling problems with continuous domains. Such problems occur naturally in diverse fields such as the design of gas and electricity networks, computer vision and investment portfolios. To overcome this problem we study FASP, a combination of ASP with fuzzy logic -- a class of manyvalued logics that can handle continuity. We specifically focus on the following issues: 1. An important question when modeling continuous optimization problems is how we should handle overconstrained problems, i.e. problems that have no solutions. In many cases we can opt to accept an imperfect solution, i.e. a solution that does not satisfy all the stated rules (constraints). However, this leads to the question: what imperfect solutions should we choose? We investigate this question and improve upon the state-of-the-art by proposing an approach based on aggregation functions. 2. Users of a programming language often want a rich language that is easy to model in. However, implementers and theoreticians prefer a small language that is easy to implement and reason about. We create a bridge between these two desires by proposing a small core language for FASP and by showing that this language is capable of expressing many of its common extensions such as constraints, monotonically decreasing functions, aggregators, S-implicators and classical negation. 3. A well-known technique for solving ASP consists of translating a program P to a propositional theory whose models exactly correspond to the answer sets of P. We show how this technique can be generalized to FASP, paving the way to implement efficient fuzzy answer set solvers that can take advantage of existing fuzzy reasoners.

This book describes research performed in the context of trust/distrust propagation and aggregation, and their use in recommender systems. This is a hot research topic with important implications for various application areas. The main innovative contributions of the work are: -new bilattice-based model for trust and distrust, allowing for ignorance and inconsistency -proposals for various propagation and aggregation operators, including the analysis of mathematical properties -Evaluation of these operators on real data, including a discussion on the data sets and their characteristics. -A novel approach for identifying controversial items in a recommender system -An analysis on the utility of including distrust in recommender systems -Various approaches for trust based recommendations (a.o. base on collaborative filtering), an in depth experimental analysis, and proposal for a hybrid approach -Analysis of various user types in recommender systems to optimize bootstrapping of cold start users.

Answer set programming (ASP) is a declarative language tailored towards solving combinatorial optimization problems. It has been successfully applied to e.g. planning problems, configuration and verification of software, diagnosis and database repairs. However, ASP is not directly suitable for modeling problems with continuous domains. Such problems occur naturally in diverse fields such as the design of gas and electricity networks, computer vision and investment portfolios. To overcome this problem we study FASP, a combination of ASP with fuzzy logic -- a class of manyvalued logics that can handle continuity. We specifically focus on the following issues: 1. An important question when modeling continuous optimization problems is how we should handle overconstrained problems, i.e. problems that have no solutions. In many cases we can opt to accept an imperfect solution, i.e. a solution that does not satisfy all the stated rules (constraints). However, this leads to the question: what imperfect solutions should we choose? We investigate this question and improve upon the state-of-the-art by proposing an approach based on aggregation functions. 2. Users of a programming language often want a rich language that is easy to model in. However, implementers and theoreticians prefer a small language that is easy to implement and reason about. We create a bridge between these two desires by proposing a small core language for FASP and by showing that this language is capable of expressing many of its common extensions such as constraints, monotonically decreasing functions, aggregators, S-implicators and classical negation. 3. A well-known technique for solving ASP consists of translating a program P to a propositional theory whose models exactly correspond to the answer sets of P. We show how this technique can be generalized to FASP, paving the way to implement efficient fuzzy answer set solvers that can take advantage of existing fuzzy reasoners.

This book describes research performed in the context of trust/distrust propagation and aggregation, and their use in recommender systems. This is a hot research topic with important implications for various application areas. The main innovative contributions of the work are: -new bilattice-based model for trust and distrust, allowing for ignorance and inconsistency -proposals for various propagation and aggregation operators, including the analysis of mathematical properties -Evaluation of these operators on real data, including a discussion on the data sets and their characteristics. -A novel approach for identifying controversial items in a recommender system -An analysis on the utility of including distrust in recommender systems -Various approaches for trust based recommendations (a.o. base on collaborative filtering), an in depth experimental analysis, and proposal for a hybrid approach -Analysis of various user types in recommender systems to optimize bootstrapping of cold start users.

This book comprehensively studies fuzzy temporal and spatial information, starting from the basics on fuzzy set theory and temporal/spatial reasoning, the development of a new model to represent fuzzy temporal/spatial information, the study of efficient and complete reasoning algorithms, and their application in an information retrieval context. This useful volume presents the first approach that goes beyond merely representing information, by thoroughly addressing a variety of reasoning tasks. It also focuses on applications in the domain of information retrieval, and demonstrating the practical importance of the proposed framework.