A Theoretical Perspective of Coinductive Logic Programming

DOI10.3233/FI-2015-1252zbMATH Open1348.68028OpenAlexW2119376944MaRDI QIDQ3187007FDOQ3187007

Agostino Dovier, Davide Ancona

Publication date: 15 August 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1252

zbMATH Keywords

denotational semanticscoinductionfoundations of logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (14)

• Title not available (Why is that?)
• Flexible coinductive logic programming
• Title not available (Why is that?)
• Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
• Title not available (Why is that?)
• On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
• Checked corecursive streams: expressivity and completeness
• Enhancing expressivity of checked corecursive streams
• Partially Typed Multiparty Sessions
• Productive corecursion in logic programming
• Coalgebraic logic programming: from Semantics to Implementation
• Partially typed multiparty sessions with internal delegation
• Deconfined Global Types for Asynchronous Sessions
• Title not available (Why is that?)

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)