Skip to main content
SpringerLink
Log in

ASP, Amalgamation, and the Conceptual Blending Workflow

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9345))

Abstract

We present a framework for conceptual blending – a concept invention method that is advocated in cognitive science as a fundamental, and uniquely human engine for creative thinking. Herein, we employ the search capabilities of ASP to find commonalities among input concepts as part of the blending process, and we show how our approach fits within a generalised conceptual blending workflow. Specifically, we orchestrate ASP with imperative Python programming, to query external tools for theorem proving and colimit computation. We exemplify our approach with an example of creativity in mathematics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that for this example, we extend the unary constructor s(n) in the naturals by an additional canonical argument c, so that the constructor becomes binary, i.e., s(c, n). This is valid when considering a classical set theoretic construction of the naturals as the cardinality of a set (see [1] for example), where the theory of the naturals corresponds to a theory of lists of the same element.

References

  1. Anderson, D., Zalta, E.: Frege, boolos and logical objects. J. Philos. Logic 33, 1–26 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Boden, M.A.: Creativity. In: Boden, M.A. (ed.) Artificial Intelligence (Handbook of Perception and Cognition), pp. 267–291. Academic Press, London (1996)

    Chapter  Google Scholar 

  3. Eppe, M., Confalonieri, R., Maclean, E., Kaliakatsos, M., Cambouropoulos, E., Schorlemmer, M., Kühnberger, K.-U.: Computational invention of cadences and chord progressions by conceptual chord-blending. In: IJCAI (2015, to appear)

    Google Scholar 

  4. Fauconnier, G., Turner, M.: The Way We Think: Conceptual Blending and the Mind’s Hidden Complexities. Basic Books, New York (2002). ISBN 978-0-465-08785-3

    Google Scholar 

  5. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Morgan and Claypool, San Rafael (2012)

    Google Scholar 

  6. Goguen, J., Harrell, D.F.: Style: a computational and conceptual blending-based approach. In: Argamon, S., Burns, K., Dubnov, S. (eds.) The Structure of Style: Algorithmic Approaches to Understanding Manner and Meaning, pp. 291–316. Springer, Heidelberg (2010). doi:10.1007/978-3-642-12337-5_12. ISBN 978-3-642-12336-8

    Chapter  Google Scholar 

  7. Goguen, J.: An introduction to algebraic semiotics, with application to user interface design. In: Nehaniv, C.L. (ed.) CMAA 1998. LNCS (LNAI), vol. 1562, pp. 242–291. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Guhe, M., Pease, A., Smaill, A., Martínez, M., Schmidt, M., Gust, H., Kühnberger, K.-U., Krumnack, U.: A computational account of conceptual blending in basic mathematics. Cogn. Syst. Res. 12(3–4), 249–265 (2011). doi:10.1016/j.cogsys.2011.01.004

    Article  Google Scholar 

  9. Ireland, A., Bundy, A.: Productive use of failure in inductive proof. J. Autom. Reason. 16(1–2), 79–111 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Johansson, M., Dixon, L., Bundy, A.: Conjecture synthesis for inductive theories. J. Autom. Reason. 47, 251–289 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  11. Montano-Rivas, O., McCasland, R., Dixon, L., Bundy, A.: Scheme-based synthesis of inductive theories. In: Sidorov, G., Hernández Aguirre, A., Reyes García, C.A. (eds.) MICAI 2010, Part I. LNCS, vol. 6437, pp. 348–361. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Mossakowski, T.: Colimits of order-sorted specifications. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 316–332. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Mosses, P.D. (ed.): CASL Reference Manual: The Complete Documentation of the Common Algebraic Specification Language. LNCS, vol. 2960. Springer, Heidelberg (2004)

    Google Scholar 

  14. Ontañón, S., Plaza, E.: Amalgams: a formal approach for combining multiple case solutions. In: Bichindaritz, I., Montani, S. (eds.) ICCBR 2010. LNCS, vol. 6176, pp. 257–271. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Pereira, F.C.: A computational model of creativity. PhD thesis, Universidade de Coimbra (2005)

    Google Scholar 

  16. Pereira, F.C.: Creativity and Artificial Intelligence: A Conceptual Blending Approach. Mouton de Gruyter, Berlin (2007)

    Google Scholar 

  17. Pierce, B.: Basic Category Theory for Computer Scientists. MIT Press, Cambridge (1991). ISBN 0262660717

    Google Scholar 

  18. Veale, T., Donoghue, D.O.: Computation and blending. Cogn. Linguist. 11(3–4), 253–282 (2000). doi:10.1515/cogl.2001.016

    Google Scholar 

Download references

Acknowledgements

This work is supported by the 7th Framework Programme for Research of the European Commission funded COINVENT project (FET-Open grant number: 611553). M. Eppe is supported by the German Academic Exchange Service.

Author information

Authors and Affiliations

  1. IIIA-CSIC, Barcelona, Spain

    Manfred Eppe, Roberto Confalonieri, Marco Schorlemmer & Enric Plaza

  2. University of Edinburgh, Edinburgh, UK

    Ewen Maclean

  3. Free University of Bozen-Bolzano, Bolzano, Italy

    Oliver Kutz

  4. International Computer Science Institute, Berkeley, USA

    Manfred Eppe

Authors
  1. Manfred Eppe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ewen Maclean
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roberto Confalonieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Oliver Kutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marco Schorlemmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Enric Plaza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manfred Eppe .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Eppe, M., Maclean, E., Confalonieri, R., Kutz, O., Schorlemmer, M., Plaza, E. (2015). ASP, Amalgamation, and the Conceptual Blending Workflow. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

  • Online ISBN: 978-3-319-23264-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation