Boi Faltings

Retrieval, reuse, revision and retention in case-based reasoning

Case-based reasoning (CBR) is an approach to problem solving that emphasizes the role of prior experience during future problem solving (i.e., new problems are solved by reusing and if necessary adapting the solutions to similar problems that were solved in the past). It has enjoyed considerable success in a wide variety of problem solving tasks and domains. Following a brief overview of the traditional problem-solving cycle in CBR, we examine the cognitive science foundations of CBR and its relationship to analogical reasoning. We then review a representative selection of CBR research in the past few decades on aspects of retrieval, reuse, revision and retention.

An incentive compatible reputation mechanism

Traditional centralized approaches to security are difficult to apply to large, distributed marketplaces in which software agents operate. Developing a notion of trust that is based on the reputation of agents can provide a softer notion of security that is sufficient for many multi-agent applications. We address the issue of incentive-compatibility (i.e. how to make it optimal for agents to share reputation information truthfully), by introducing a side-payment scheme, organized through a set of broker agents, that makes it rational for software agents to truthfully share the reputation information they have acquired in their past experience. We also show how to use a cryptographic mechanism to protect the integrity of reputation information and to achieve a tight bounding between the identity and reputation of an agent.

Qualitative spatial reasoning: the CLOCK project

Spatial reasoning is ubiquitous in human problem solving. Significantly, many aspects of it appear to be qualitative. This paper describes a general framework for qualitative spatial reasoning and demonstrates how it can be used to understand complex mechanical systems, such as clocks. The framework is organized around three ideas. (1) We conjecture that no powerful, general-purpose, purely qualitative representation of spatial properties exists (the poverty conjecture). (2) We describe the MD/PV model of spatial reasoning, which overcomes this fundamental limitation by combining the power of diagrams with qualitative spatial representations. In particular, a metric diagram, which combines quantitative and symbolic information, is used as the foundation for constructing a place vocabulary, a symbolic representation of shape and space which supports qualitative spatial reasoning. (3) We claim that shape and connectivity are the central features of qualitative spatial representations for kinematics. We begin by exploring these ideas in detail, pointing out why simpler representations have not proven fruitful. We also describe how inferences can be organized using the MD/PV model. We demonstrate the utility of this model by describing clock, a program which reasons about complex two-dimensional mechanisms. clock starts with a CAD description of a mechanisms parts and constructs a qualitative simulation of how it can behave. clock successfully performed the first complete qualitative simulation of a mechanical clock from first principles, a milestone in qualitative physics. We also examine other work on qualitative spatial reasoning, and show how it fits into this framework. Finally, we discuss new research questions this framework raises.

Reliable QoS monitoring based on client feedback

Service-level agreements (SLAs) establish a contract between service providersand clients concerning Quality of Service (QoS) parameters. Without properpenalties, service providers have strong incentives to deviate from theadvertised QoS, causing losses to the clients. Reliable QoS monitoring (andproper penalties computed on the basis of delivered QoS) are thereforeessential for the trustworthiness of a service-oriented environment. In thispaper, we present a novel QoS monitoring mechanism based on quality ratings from theclients. A reputation mechanism collects the ratings and computes theactual quality delivered to the clients. The mechanism provides incentives forthe clients to report honestly, and pays special attention to minimizing costand overhead1.

Consistency techniques for continuous constraints

We consider constraint satisfaction problems with variables in continuous, numerical domains. Contrary to most existing techniques, which focus on computing one single optimal solution, we address the problem of computing a compact representation of the space of all solutions admitted by the constraints. In particular, we show how globally consistent (also called decomposable) labelings of a constraint satisfaction problem can be computed.Our approach is based on approximating regions of feasible solutions by 2k-trees, a representation commonly used in computer vision and image processing. We give simple and stable algorithms for computing labelings with arbitrary degrees of consistency. The algorithms can process constraints and solution spaces of arbitrary complexity, but with a fixed maximal resolution.Previous work has shown that when constraints are convex and binary, path-consistency is sufficient to ensure global consistency. We show that for continuous domains, this result can be generalized to ternary and in fact arbitrary n-ary constraints using the concept of (3,2)-relational consistency. This leads to polynomial-time algorithms for computing globally consistent labelings for a large class of constraint satisfaction problems with continuous variables.

Large scale, type-compatible service composition

Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches of input/output types. However, this does not work when the available services only cover a part of the range of the input type. We present an algorithm that also allows partial matches and composes them using switches that decide on the required service at runtime based on the actual data type. We report experiments on randomly generated composition problems that show that using partial matches can decrease the failure rate of the integration algorithm using only complete matches by up to 7 times with no increase in the number of directory accesses required. This shows that composition with partial matches is an essential and useful element of Web service composition.

Enriching buyers' experiences: the SmartClient approach

In electronic commerce, a satisfying buyer experience is a key competitive element. We show new techniques for better adapting interaction with an electronic catalog system to actual buying behavior. Our model replaces the sequential separation of needs identification and product brokering with a conversation in which both processes occur simultaneously. This conversation supports the buyer in formulating his or her needs, and in deciding which criteria to apply in selecting a product to buy. We have experimented with this approach in the area of travel planning and developed a system called SmartClient Travel which supports this process. It includes tools for need identification, visualization of alternatives, and choosing the most suitable one. We describe the system and its implementation, and report on user studies showing its advantages for electronic catalogs.

Minimum payments that reward honest reputation feedback

Online reputation mechanisms need honest feedback to function effectively. Self interested agents report the truth only when explicit rewards offset the cost of reporting and the potential gains that can be obtained from lying. Side-payment schemes (monetary rewards for submitted feedback) can make truth-telling rational based on the correlation between the reports of different buyers.In this paper we use the idea of automated mechanism design to construct the payments that minimize the budget required by an incentive-compatible reputation mechanism. Such payment schemes are defined by a linear optimization problem that can be solved efficiently in realistic settings. Furthermore, we investigate two directions for further lowering the cost of incentive-compatibility: using several reference reports to construct the side-payments, and filtering out reports that are probably false.

Arc-consistency for continuous variables

Reference LIA-ARTICLE-1994-001doi:10.1016/0004-3702(94)90022-1View record in Web of Science Record created on 2006-12-13, modified on 2017-05-12

Qualitative kinematics in mechanisms

This paper investigates the problem of reasoning about the kinematic interactions between parts of a mechanism We introduce the concept of Place Vocabularies as a useful symbolic description of the possible interactions We examine the requirements for the representation and introduce a definition of place vocabularies that satisfies them. We show how this representation can be computed from metric data and used as a basis for qualitative envisionments of mechanism behavior, and describe implemented algorithms to solve this problem.