A theoretical perspective of coinductive logic programming
From MaRDI portal
Recommendations
Cited in
(18)- Enhancing expressivity of checked corecursive streams
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
- scientific article; zbMATH DE number 1670488 (Why is no real title available?)
- Infinite computation, co-induction and computational logic
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- scientific article; zbMATH DE number 4181320 (Why is no real title available?)
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
- scientific article; zbMATH DE number 1314226 (Why is no real title available?)
- Productive corecursion in logic programming
- Foundations of regular coinduction
- Flexible coinductive logic programming
- Coinductive Logic Programming
- Coalgebraic logic programming: from Semantics to Implementation
- Deconfined Global Types for Asynchronous Sessions
- Checked corecursive streams: expressivity and completeness
- Partially Typed Multiparty Sessions
- Partially typed multiparty sessions with internal delegation
- Open compliance in multiparty sessions with partial typing
This page was built for publication: A theoretical perspective of coinductive logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187007)