Productive corecursion in logic programming

DOI10.1017/S147106841700028XzbMath1422.68025arXiv1707.01541OpenAlexW2964092958MaRDI QIDQ4592714

Yue Li, Ekaterina Komendantskaya

Publication date: 8 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.01541

zbMATH Keywords

productivityHorn clauses(co)induction(co)recursioninfinite term trees

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (6)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Flexible coinductive logic programming ⋮ The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them ⋮ Logic programming: laxness and saturation

Uses Software

• CoALP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
• Fundamental properties of infinite trees
• Semantics of infinite tree logic programming
• A productivity checker for logic programming
• Operational semantics of resolution and productivity in Horn clause logic
• Proof Relevant Corecursive Resolution
• Introduction to Bisimulation and Coinduction
• A Theoretical Perspective of Coinductive Logic Programming
• Coinductive Logic Programming and Its Applications
• Top-down semantics of fair computations of logic programs
• A dynamic approach to characterizing termination of general logic programs
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Coinductive Logic Programming
• A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
• Coalgebraic logic programming: from Semantics to Implementation

This page was built for publication: Productive corecursion in logic programming