Saturated semantics for coalgebraic logic programming

DOI10.1007/978-3-642-40206-7_8zbMATH Open1394.68053OpenAlexW19531118MaRDI QIDQ2848941FDOQ2848941

Authors: Filippo Bonchi, Fabio Zanasi 

Publication date: 13 September 2013

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40206-7_8

Recommendations

• Coalgebraic semantics for parallel derivation strategies in logic programming
• Bialgebraic semantics for logic programming
• Logic programming: laxness and saturation
• Coalgebraic derivations in logic programming
• Coalgebraic semantics for derivations in logic programming

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic programming (68N17) Eilenberg-Moore and Kleisli constructions for monads (18C20) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55)

Cited In (11)

• Category theoretic semantics for theorem proving in logic programming: embracing the laxness
• Logic programming: laxness and saturation
• Extending Coq with Imperative Features and Its Application to SAT Verification
• Coalgebraic semantics for parallel derivation strategies in logic programming
• Exploiting parallelism in coalgebraic logic programming
• Bialgebraic semantics for logic programming
• Coalgebraic logic programming: from Semantics to Implementation
• A Coalgebraic Approach to Unification Semantics of Logic Programming
• Title not available (Why is that?)
• Coalgebraic derivations in logic programming
• Title not available (Why is that?)

This page was built for publication: Saturated semantics for coalgebraic logic programming

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