When almost is not even close: Remarks on the approximability of HDTP

A growing number of researchers in Cognitive Science advocate the thesis that human cognitive capacities are constrained by computational tractability. If right, this thesis also can be expected to have far-reaching consequences for work in Artificial General Intelligence: Models and systems considered as basis for the development of general cognitive architectures with human-like performance would also have to comply with tractability constraints, making in-depth complexity theoretic analysis a necessary and important part of the standard research and development cycle already from a rather early stage. In this paper we present an application case study for such an analysis based on results from a parametrized complexity and approximation theoretic analysis of the Heuristic Driven Theory Projection (HDTP) analogy-making framework

Analogy, Amalgams, and Concept Blending

Concept blending — a cognitive process which allows for the combination of certain elements (and their relations) from originally distinct conceptual spaces into a new unified space combining these previously separate elements, and enables reasoning and inference over the combination — is taken as a key element of creative thought and combinatorial creativity. In this paper, we provide an intermediate report on work towards the development of a computational-level and algorithmic-level account of concept blending. We present the theoretical background as well as an algorithmic proposal combining techniques from computational analogy-making and case-based reasoning, and exemplify the feasibility of the approach in two case studies.. © 2015 Cognitive Systems Foundation.The authors acknowledge the financial support of the Future and Emerging Technologies programme within the Seventh Framework Programme for Research of the European Commission, under FET-Open grant number: 611553 (COINVENT)Peer Reviewe

Towards a computational- and algorithmic-level account of concept blending using analogies and amalgams

Concept blending–a cognitive process which allows for the combination of certain elements (and their relations) from originally distinct conceptual spaces into a new unified space combining these previously separate elements, and enables reasoning and inference over the combination–is taken as a key element of creative thought and combinatorial creativity. In this article, we summarise our work towards the development of a computational-level and algorithmic-level account of concept blending, combining approaches from computational analogy-making and case-based reasoning (CBR). We present the theoretical background, as well as an algorithmic proposal integrating higher-order anti-unification matching and generalisation from analogy with amalgams from CBR. The feasibility of the approach is then exemplified in two case studies

Grand Unification at Intermediate Mass Scales through Extra Dimensions

One of the drawbacks of conventional grand unification scenarios has been that the unification scale is too high to permit direct exploration. In this paper, we show that the unification scale can be significantly lowered (perhaps even to the TeV scale) through the appearance of extra spacetime dimensions. Such extra dimensions are a natural consequence of string theories with large-radius compactifications. We show that extra spacetime dimensions naturally lead to gauge coupling unification at intermediate mass scales, and moreover may provide a natural mechanism for explaining the fermion mass hierarchy by permitting the fermion masses to evolve with a power-law dependence on the mass scale. We also show that proton-decay constraints may be satisfied in our scenario due to the higher-dimensional cancellation of proton-decay amplitudes to all orders in perturbation theory. Finally, we extend these results by considering theories without supersymmetry; experimental collider signatures; and embeddings into string theory. The latter also enables us to develop several novel methods of explaining the fermion mass hierarchy via $D$-branes. Our results therefore suggest a new approach towards understanding the physics of grand unification as well as the phenomenology of large-radius string compactifications.Comment: 65 pages, LaTeX, 20 figure

Reduction

Reduction and reductionism have been central philosophical topics in analytic philosophy of science for more than six decades. Together they encompass a diversity of issues from metaphysics and epistemology. This article provides an introduction to the topic that illuminates how contemporary epistemological discussions took their shape historically and limns the contours of concrete cases of reduction in specific natural sciences. The unity of science and the impulse to accomplish compositional reduction in accord with a layer-cake vision of the sciences, the seminal contributions of Ernest Nagel on theory reduction and how they strongly conditioned subsequent philosophical discussions, and the detailed issues pertaining to different accounts of reduction that arise in both physical and biological science (e.g., limit-case and part-whole reduction in physics, the difference-making principle in genetics, and mechanisms in molecular biology) are explored. The conclusion argues that the epistemological heterogeneity and patchwork organization of the natural sciences encourages a pluralist stance about reduction

A Variant of Higher-Order Anti-Unification

We present a rule-based Huet's style anti-unification algorithm for simply-typed lambda-terms in η-long -normal form, which computes a least general higher-order pattern generalization. For a pair of arbitrary terms of the same type, such a generalization always exists and is unique modulo α-equivalence and variable renaming. The algorithm computes it in cubic time within linear space. It has been implemented and the code is freely available. © Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret; licensed under Creative Commons License CC-BY 24th International Conference on Rewriting Techniques and Applications (RTA'13).This research has been partially supported by the projects HeLo (TIN2012-33042) and TASSAT (TIN2010-20967-C04-01), by the Austrian Science Fund (FWF) with the project SToUT (P 24087-N18) and by the Generalitat de Catalunya with the grant AGAUR 2009-SGR-1434.Peer Reviewe

E-Generalization Using Grammars

We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets. We present a framework to combine Inductive Logic Programming and E-generalization that includes an extension of Plotkin's lgg theorem to the equational case. We demonstrate the potential power of E-generalization by three example applications: computation of suggestions for auxiliary lemmas in equational inductive proofs, computation of construction laws for given term sequences, and learning of screen editor command sequences.Comment: 49 pages, 16 figures, author address given in header is meanwhile outdated, full version of an article in the "Artificial Intelligence Journal", appeared as technical report in 2003. An open-source C implementation and some examples are found at the Ancillary file

Discourse metaphors: the link between figurative language and habitual analogies

-- draft-