Flexible coinductive logic programming

DOI10.1017/S147106842000023XzbMath1468.68054arXiv2008.02140OpenAlexW3103140263MaRDI QIDQ5140017

Davide Ancona, Elena Zucca, Francesco Dagnino

Publication date: 13 December 2020

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

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

zbMATH Keywords

operational semanticscompletenesssoundnesscoinductiondeclarative semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

Enhancing expressivity of checked corecursive streams ⋮ Checked corecursive streams: expressivity and completeness ⋮ Classical (co)recursion: Mechanics ⋮ Unnamed Item ⋮ The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them

Uses Software

• CoALP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coinductive big-step operational semantics
• Fundamental properties of infinite trees
• A productivity checker for logic programming
• A lattice-theoretical fixpoint theorem and its applications
• Tabling, Rational Terms, and Coinduction Finally Together!
• Generalizing Inference Systems by Coaxioms
• Infinite Computation, Co-induction and Computational Logic
• A Theoretical Perspective of Coinductive Logic Programming
• Iterative algebras at work
• Productive corecursion in logic programming
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Coinductive Logic Programming
• Coalgebraic logic programming: from Semantics to Implementation