Exploiting parallelism in coalgebraic logic programming

  1. Komendantskaya, E. 2
  2. Schmidt, M. 1
  3. Heras, J. 2
  1. 1 University of Osnabrück
    info

    University of Osnabrück

    Osnabrück, Alemania

    ROR https://ror.org/04qmmjx98

  2. 2 University of Dundee
    info

    University of Dundee

    Dundee, Reino Unido

    ROR https://ror.org/03h2bxq36

Journal:
Electronic Notes in Theoretical Computer Science

ISSN: 1571-0661

Year of publication: 2014

Volume: 303

Pages: 121-148

Type: Article

DOI: 10.1016/J.ENTCS.2014.02.007 SCOPUS: 2-s2.0-84896482596 GOOGLE SCHOLAR

More publications in: Electronic Notes in Theoretical Computer Science

Institutional repository: lock_openOpen access Editor

Abstract

We present a parallel implementation of Coalgebraic Logic Programming (CoALP) in the programming language Go. CoALP was initially introduced to reflect coalgebraic semantics of logic programming, with coalgebraic derivation algorithm featuring both corecursion and parallelism. Here, we discuss how the coalgebraic semantics influenced our parallel implementation of logic programming. © 2014 Elsevier B.V.