2011
DOI: 10.1016/j.cogsys.2011.01.004
|View full text |Cite
|
Sign up to set email alerts
|

A computational account of conceptual blending in basic mathematics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(12 citation statements)
references
References 13 publications
0
12
0
Order By: Relevance
“…On top of the ASP-based implementation, we propose metrics to evaluate the quality of blends, based on the cognitive optimality principles by Fauconnier and Turner [4]. A number of researchers in the field of computational creativity have recognised the value of conceptual blending for building creative systems, and particular implementations of this cognitive theory have been proposed [18,15,16,6,8,3]. They are, however, mostly limited in the expressiveness of their representation language, and it is in most cases unclear how they deal with inconsistencies and how the generic space is computed.…”
Section: Resultsmentioning
confidence: 99%
“…On top of the ASP-based implementation, we propose metrics to evaluate the quality of blends, based on the cognitive optimality principles by Fauconnier and Turner [4]. A number of researchers in the field of computational creativity have recognised the value of conceptual blending for building creative systems, and particular implementations of this cognitive theory have been proposed [18,15,16,6,8,3]. They are, however, mostly limited in the expressiveness of their representation language, and it is in most cases unclear how they deal with inconsistencies and how the generic space is computed.…”
Section: Resultsmentioning
confidence: 99%
“…The selection of formulae is again based on a heuristic component: Mappings in which substitutions can be reused get assigned a lower cost than isolated substitutions, leading to a preference for coherent over incoherent mappings. 2 Concerning applications of HDTP, for instance Guhe et al (2010) apply the framework in modeling a potential inductive analogy-based process for establishing the fundamental concepts of arithmetics, Guhe et al (2011) describe an account of a process blending different conceptualizations of number into new conceptualizations recognizing common features and combining distinct ones, and use HDTP for solving geometric analogies. Further successful and completely worked out application examples, among others, also can be found as part of this thesis in Chap.…”
Section: Computational Properties Ofmentioning
confidence: 99%
“…As opposed to other domains, like architecture, where abstractions relate to the current closure, abstractions in analytical problem solving relates to the problem goal. Analogies for similar problems are a powerful solving strategy as entire feature association sequences are revealed (Guhe et al, 2011). Analogies are used to find structural similarities between precedents and the current problem and then the unmatched parts represent the subrequirements to be solved.…”
Section: Figure 9: Association Sequences (Patterns) In Electronic Embmentioning
confidence: 99%