Refinements of restricted higher-order anti-unification for heuristic-driven theory projection

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Empirical research supports the belief that structural commonalities between two domains are the main guidance for the construction of analogies. Restricted higher-order anti-unification has been shown suitable to find structural commonalties and generate mappings between domains in the symbolic analogy model Heuristic-Driven Theory Projection (HDTP). This paper will describe how to enforce and integrate restrictions on mappings between symbols from a many-to-many up to a one-to-one symbol correspondence. We will also discuss how sorts together with sortal ontologies can be incorporated into anti-unification within HDTP and thereby restrict possible mappings between domains. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Schmidt, M., Gust, H., Kühnberger, K. U., & Krumnack, U. (2011). Refinements of restricted higher-order anti-unification for heuristic-driven theory projection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7006 LNAI, pp. 289–300). https://doi.org/10.1007/978-3-642-24455-1_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free