Exploiting parallelism in coalgebraic logic programming

From MaRDI portal
Publication:280198

DOI10.1016/J.ENTCS.2014.02.007zbMATH Open1337.68054arXiv1312.4454OpenAlexW2051432956WikidataQ113317889 ScholiaQ113317889MaRDI QIDQ280198FDOQ280198


Authors: Ekaterina Komendantskaya, Martin Schmidt, Jónathan Heras Edit this on Wikidata


Publication date: 6 May 2016

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.


Full work available at URL: https://arxiv.org/abs/1312.4454




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Exploiting parallelism in coalgebraic logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280198)