Exploiting Parallelism in Coalgebraic Logic Programming

Ekaterina Komendantskaya; Martin Schmidt; J\'onathan Heras

arXiv:1312.4454·cs.PL·December 20, 2013·1 cites

Exploiting Parallelism in Coalgebraic Logic Programming

Ekaterina Komendantskaya, Martin Schmidt, J\'onathan Heras

PDF

Open Access

TL;DR

This paper introduces a parallel implementation of Coalgebraic Logic Programming in Go, leveraging coalgebraic semantics to enhance parallelism and corecursion capabilities in logic programming.

Contribution

It presents the first parallel implementation of CoALP, demonstrating how coalgebraic semantics can be effectively utilized in practical parallel logic programming.

Findings

01

Successful implementation of parallel CoALP in Go

02

Enhanced corecursion and parallelism in logic programming

03

Potential for improved performance in logic-based applications

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.

Peer Reviews

No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.

Videos

No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.

Taxonomy

TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Formal Methods in Verification