Exploiting parallelism in coalgebraic logic programming
From MaRDI portal
(Redirected from Publication:280198)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- A theory of observables for logic programs
- An interactive semantics of logic programming
- Coalgebraic derivations in logic programming
- Coalgebraic semantics for derivations in logic programming
- Coalgebraic semantics for parallel derivation strategies in logic programming
- Communicating sequential processes
- Observable behaviors and equivalences of logic programs
- On the algebraic structure of declarative programming languages
- On the sequential nature of unification
- Parallel complexity of logical query programs
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
- Saturated semantics for coalgebraic logic programming
- Type Inference by Coinductive Logic Programming
Cited in
(8)- Coalgebraic semantics for parallel derivation strategies in logic programming
- Logic programming: laxness and saturation
- A cooperative parallelization approach for property-directed \(k\)-induction
- Category theoretic semantics for theorem proving in logic programming: embracing the laxness
- scientific article; zbMATH DE number 7350768 (Why is no real title available?)
- Efficient Coalgebraic Partition Refinement
- CoALP
- Coalgebraic derivations in logic programming
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)
