• Aucun résultat trouvé

Conceptual Blending in Case Adaptation

N/A
N/A
Protected

Academic year: 2022

Partager "Conceptual Blending in Case Adaptation"

Copied!
5
0
0

Texte intégral

(1)

Conceptual Blending in Case Adaptation (Position Paper)

Am´ılcar Cardoso and Pedro Martins CISUC, Department of Informatics Engineering

University of Coimbra, Coimbra, Portugal

Abstract. We propose that Conceptual Blending (CB) can play a role within the Case-Based Reasoning (CBR) paradigm, particularly in the Reuse andRevise tasks of the classic model of the problem solving cy- cle in CBR, as an alternative adaptation mechanism that may provide suitable solutions in computational creativity setups, where novel and surprising solutions are sought. We discuss how a particular computa- tional implementation of CB can intervene in the CBR cycle, and use the results of an experiment made in the past to illustrate the aproach.

We focus our attention on graph-based structured cases. Other case rep- resentations could also be considered in the future.

1 Introduction

The Conceptual Blending (CB) theory [3] intends to explain several cognitive phenomena related to the creation of ideas and meanings. A key element in this theory is the mental space, which corresponds to a temporary and partial structure of knowledge built for the purpose of local understanding and action.

The CB framework relies on a network comprised of at least four connected mental spaces (Figure 1). Two or more of them correspond to theinput spaces, which are the initial domains, i.e., the content that will be blended. Then, a cross-space mapping, i.e., a partial correspondence between the input spaces, is established. The correspondences between elements of the different input spaces is not arbitrary; elements are only matched if they are perceived as similar in some way. This association is reflected in another mental space, the generic space, which contains elements common to the different input spaces, capturing the conceptual structure that is shared by the initial mental spaces. The result of the blending process is the blend, a new mental space that maintains partial structures from the input spaces, combined with an emergent structure.

In this position paper, we propose that Conceptual Blending can play a role within Case-Based Reasoning, particularly in theReuse andRevise tasks of the classic model of the problem solving cycle in CBR, known as the “4 REs” [1], as an alternative adaptation mechanism that may provide better solutions in computational creativity setups, and possibly also for problem solving. We will focus our attention on graph-based structured cases (like in [7]), but we think the approach could also be adapted to other case representations [2]. To better

Copyright © 2015 for this paper by its authors. Copying permitted for private and academic purposes. In Proceedings of the ICCBR 2015 Workshops. Frankfurt, Germany.

(2)

Fig. 1.The original four-space conceptual blending network [4].

explain our idea, we will use an implementation of the CB mechanism called Divago [6], previously developed by our team.

After the current introduction, we will briefly describe Divago in Section 2 and present our proposal in Section 3. In Section 4 we draw some conclusions.

2 Divago

The CB framework has served as the basis for several artificial creative systems.

To discuss the role of CB within the CBR cycle, we focus on the Divago archi- tecture [6], which relies on one of the most thorough and detailed computational models of CB to date.

The Divago framework works on a multi-domain knowledge base where the basic representation formalism is the concept map, a semantic network that de- notes the relationship between the concepts of a given domain. It is composed of several modules (Fig. 2) that reflect the different stages of the CB mechanism.

Factory

Constraints

Goal Elaboration

Multi-domain Knowledge Base

Mapper Blender

Genetic Algorithm

Convergent Strategy

Fig. 2.Divago’s architecture.

The process starts by feeding a pair of input spaces (domains) from the knowledge base into the Mapper module, which is responsible for performing

(3)

the selection of elements for projection. Such selection is achieved by means of a partial mapping between the input spaces using structural alignment. This operation looks for the largest isomorphic (structurally equivalent) pair of sub- graphs contained in the input spaces. Each mapping is a set of mapping relations m(x, y) between two concepts, one of each input space.

For each resulting mapping, theBlender module performs a projection op- eration into the blended space: for each m(x, y) in the mapping, it produces a nondeterministic projection choice between x, y, ∅ and x|y (which means both x and y); each combination of choices is the seed of a possible blend (to be completed and elaborated in the next stages). This process results in a graph structure (the blendoid) that includes all projection choices and thus represent the search space for all the blends that may result from the mapping.

TheFactorymodule is responsible for exploring this search space. It is based on a variation of a genetic algorithm (GA) that uses theElaboration module to enrich blends with additional knowledge and the Constraints module to assess their quality. This module provides an implementation of theoptimality princi- ples (a set of principles that ensure a coherent and highly integrated blend [3]).

When an adequate solution is found or a pre-defined number of iterations is attained, the Factory stops the execution of the GA and returns the best blend.

TheConstraints module acts, thus, as the “fitness function” of the algorithm.

3 Conceptual blending in case-adaptation

The classic model of the problem solving cycle in CBR, known as the “4 REs”, comprises 4 tasks: Retrieve, Reuse, Revise and Retain [1]. In the core of the process lies acase base of stored past experiences, each one of them comprising a problem description and the respective solution.

Although cases can be represented in many different ways [2], we will consider the situation where a structured representation is used, like for instance [7]. In particular, we will assume that there are relations betweenattributes. Some of them allow for hierarchical organisations (e.g.,isa andpartwhole), others induce a network structures (e.g.,purpose,shape, relations for relative position). Table 1 describes, using a Prolog-like notation, a fragment of a case for a “House”, where such relations occur. The right column is a partial description of the attribute/value pair part of the same case.

Coming back to the “4 REs” cycle, the reasoning process starts with a new problem specification being given to the first task, Retrieve, which seeks for stored cases with similar problem descriptions, using some similarity criterion.

The result is a list of retrieved cases, of which one can be selected as having the most similar problem description to the given problem. In the general case, the similatity is not absolute and differences with the given problem description exist. This requires that the retrieved case is subject to some sort of adaptation in the taskReuse, trying to compensate for the differences with the given problem description.Revise will be responsible for evaluating the quality of the result.

(4)

Table 1.Fragment of the “House” case.

isa(house,physical structure) part whole(door, house) instance of(r1, roof) isa(door, physical object) part whole(window, house) instance of(b1, body) isa(window, physical object) part whole(roof, house) instance of(d1, door) isa(roof, physical object) part whole(body, house) instance of(w1, window) isa(body, physical object) part whole(room, house) shape(r1, triangle) isa(observation, task) purpose(body, container) shape(b1, square) isa(protection, task) purpose(door, entrance) shape(w1, square) isa(entrance, task) purpose(window, observation)

isa(container, physical object) purpose(roof, protection)

Now, let us assume that the retrieved case,cr, is the one described in Table 1.

This might happen, for instance, if the case base was composed of descriptions of houses, the problem to solve was to find a house description according to a given specification and the specification of cr was the most similar to the given one.

Let us also assume that we are in a creative setup, where we want to find ideas for houses that, although satisfying the specification, are novel and surprising.

Our proposal is to seek for surprising solutions by processing the adaptation throughblending cr with knowledge from a different domain. The result will be a case that shares part of its description with the retrieved case, but includes contributions from the other domain. Such contributions may, for instance, fill existing gaps incr, substitute part of its structure, etc. As we will see, the result may be more or lessdivergent from the original domain of “houses” according to how we control the blending process and “how far” from “houses” the other domain is. The domain to use in this process may be chosen by the user, or may result from a contextual analysis whose discussion is outside the scope of this paper. We argue that Divago can deal with the process in a suitable way.

To illustrate our proposal, we re-visit the experiment described in [5], where the blend of two domains, “boats” and “houses”, is explored using just the mod- ules Mapper and Blender of Divago, with the aim of studying their generation potential. The situation is very similar to the one described in the previous sec- tion, ascr, the “House” case, can be seen as an instance of the original “houses”

domain. With this analysis, we intend to illustrate how the “House” case can be merged with the domain “boats”.

In the experiment, the blendoid resulting from the most frequent mapping represents a wide variety of instances for “boat-house”. We show six of them in Figure 3, where the visual representation ofcris shown on the left.

Fig. 3.The retrieved “House” case and six possible blends with the “boat” domain.

(5)

We can see that the weight of the “boats” domain in the blends varies a lot.

The divergence of the blends from the stereotypical description of a Boat and from cr also varies a lot, from a house with a hatch instead of a window to a house with a sail instead of a door and a mast instead of a roof.

In Divago, the GA-like search for blends is guided by an implementation of a variation of the “optimality principles” proposed in the CB theory, which favours the coherence of the resulting blends. In the context of this proposal, however, a metric for the similarity with the original problem specification should also be taken into account, and possibly assume a prevailing weight in measuring the quality of the blends.

4 Conclusions

We argued that Conceptual Blending, and in particular its computational im- plementation Divago, can provide an alternative adaptation mechanism for the Reuse and Revise tasks of the classic CBR model. The idea is to blend the case selected in theRetrieve task with knowledge from a different domain. This may prove especially effective in computational creativity contexts, where it may provide an iterative divergence mechanism coupled with evaluation. The crite- ria for evaluating each possible blend may combine measures of coherence with measures of distance to the given problem specification. This is a preliminary proposal in the context of a Position Paper. Definitely, further research is needed to understand its limits.

Acknowledgements.The authors acknowledge the financial support from the Future and Emerging Technologies (FET) programme within the Seventh Frame- work Programme for Research of the European Commission, under the Con- CreTe FET-Open project (grant number 611733) and the PROSECCO FET- Proactive project (grant number 600653).

References

1. Aamodt, A., Plaza, E.: Case-based reasoning: Foundational issues, methodological variations, and system approaches. AI communications 7(1), 39–59 (1994)

2. Bergmann, R., Kolodner, J., Plaza, E.: Representation in case-based reasoning.

Knowl. Eng. Rev. 20(3), 209–213 (Sep 2005)

3. Fauconnier, G., Turner, M.: Conceptual integration networks. Cognitive Science 22(2), 133–187 (1998)

4. Fauconnier, G., Turner, M.: The Way We Think. New York: Basic Books (2002) 5. Pereira, F.C., Cardoso, A.: The boat-house visual blending experience. In: Procs

2nd. Workshop on Creative Systems, ECAI 2002, Lyon, France (2002)

6. Pereira, F.C.: Creativity and AI: A Conceptual Blending approach. Ph.D. thesis, FCTUC, Universidade de Coimbra, Portugal (2005)

7. Plaza, E.: Cases as terms: A feature term approach to the structured representa- tion of cases. In: Case-Based Reasoning Research and Development, pp. 265–276.

Springer (1995)

Références

Documents relatifs

We prove that there exists an equivalence of categories of coherent D-modules when you consider the arithmetic D-modules introduced by Berthelot on a projective smooth formal scheme X

Abstract—In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is

• by implementing novel modelling methods as proofs-of-concepts created for a selected domain / purpose, including certain types of model-enabled evaluation

Unfortunately, due to the fact that the upward cover set we defined only takes sub- concepts already present in the TBox into account, neither γ nor its refinement γ 0 are

The blending diagrams (or networks) can be analysed and computed by the Heterogeneous Tool Set Hets , a proof management system. Hets is integrated into Ontohub 7 , an

In future work, an additional adaptation approach will be investigated for se- mantic workflows, similar to the adaptation approach presented by Minor

With this ob- jective in mind, we propose an upward refinement operator for generalising EL ++ concepts which is inductively defined over the structure of concept descriptions..

Attaching the non-functional requirements transparency to the requirements building process increases the overall awareness in the universe of discourse, making explicit