2006
DOI: 10.1016/j.tcs.2005.11.009
|View full text |Cite
|
Sign up to set email alerts
|

Metaphors and heuristic-driven theory projection (HDTP)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(16 citation statements)
references
References 8 publications
0
16
0
Order By: Relevance
“…FP Anti-Unification Input: Two terms f , g, and naturals l, m, p ∈ N. Problem: Is there an anti-unifier h, containing at least l 0-ary variables and at least m higher arity variables, and two substitutions σ, τ using only renamings, fixations, and at most p permutations such that h With respect to the original version of HDTP, [5] also offers some insight. As detailed in [12], instead of using restricted higher-order anti-unifications, HDTP initially was based on a mechanism reducing higher-order to first-order anti-unifications by introducing subterms built from what was called "admissible sequences":…”
Section: Previous Results On the Parametrized Complexity Of Hdtpmentioning
confidence: 99%
See 2 more Smart Citations
“…FP Anti-Unification Input: Two terms f , g, and naturals l, m, p ∈ N. Problem: Is there an anti-unifier h, containing at least l 0-ary variables and at least m higher arity variables, and two substitutions σ, τ using only renamings, fixations, and at most p permutations such that h With respect to the original version of HDTP, [5] also offers some insight. As detailed in [12], instead of using restricted higher-order anti-unifications, HDTP initially was based on a mechanism reducing higher-order to first-order anti-unifications by introducing subterms built from what was called "admissible sequences":…”
Section: Previous Results On the Parametrized Complexity Of Hdtpmentioning
confidence: 99%
“…This line of work has resulted in several different frameworks for computational analogical reasoning, featuring systems as prominent as Hofstadter's Copycat [8] or the famous Structure-Mapping Engine (SME) [9] and MAC/FAC [10]. Whilst the latter two systems implement a version of Gentner's Structure-Mapping Theory (SMT) [11], more recently a different, generalization-based approach has been proposed: Heuristic-Driven Theory Projection (HDTP) [12,13].…”
Section: (In)tractability and Heuristic-driven Theory Projectionmentioning
confidence: 99%
See 1 more Smart Citation
“…ICARUS employs a representational mapping mechanism to transfer plan goal decompositions between different 2d grid games (Shapiro et al 2008). Kühnberger et al"s I-Cog (2008) explores the trade-offs between analogy and two other reasoning modules, all of which operate over noisy data, using the Heuristic-Driven Theory Projection (Gust et al 2006) model of analogy. Schwering et al (2008) identifies the importance of combining analogy with deductive and inductive techniques for achieving human level reasoning.…”
Section: Discussionmentioning
confidence: 99%
“…A further heuristic in HDTP is the minimization of substitution lengths in the analogical relation, i.e. the simpler the analogy the better [27]. The motivation for this heuristic is to prevent arbitrary associations.…”
Section: Heuristic-driven Theory Projectionmentioning
confidence: 99%