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
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
- Coalgebraic semantics for parallel derivation strategies in logic programming
- scientific article; zbMATH DE number 4128360
- scientific article; zbMATH DE number 4049157
- Coalgebraic logic programming: from Semantics to Implementation
- Parallel Logic Programming: A Sequel
- PARLOG: parallel programming in logic
- scientific article; zbMATH DE number 1862076
Cites Work
- On the algebraic structure of declarative programming languages
- Parallel complexity of logical query programs
- A theory of observables for logic programs
- Observable behaviors and equivalences of logic programs
- Saturated semantics for coalgebraic logic programming
- Coalgebraic derivations in logic programming
- Coalgebraic semantics for parallel derivation strategies in logic programming
- Coalgebraic semantics for derivations in logic programming
- Title not available (Why is that?)
- Type Inference by Coinductive Logic Programming
- On the sequential nature of unification
- Communicating sequential processes
- An interactive semantics of logic programming
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Cited In (8)
- Logic programming: laxness and saturation
- Coalgebraic semantics for parallel derivation strategies in logic programming
- CoALP
- A cooperative parallelization approach for property-directed \(k\)-induction
- Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness
- Coalgebraic derivations in logic programming
- Title not available (Why is that?)
- Efficient Coalgebraic Partition Refinement
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)