A productivity checker for logic programming

DOI10.1007/978-3-319-63139-4_10zbMath1485.68037arXiv1608.04415OpenAlexW2963613549MaRDI QIDQ2409734

Patricia Johann, Ekaterina Komendantskaya, Martin Schmidt

Publication date: 13 October 2017

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

zbMATH Keywords

productivityterminationlogic programmingcoinductioncorecursion

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (7)

Operational semantics of resolution and productivity in Horn clause logic ⋮ Enhancing expressivity of checked corecursive streams ⋮ Checked corecursive streams: expressivity and completeness ⋮ Productive corecursion in logic programming ⋮ Unnamed Item ⋮ Flexible coinductive logic programming ⋮ Logic programming: laxness and saturation

Uses Software

• CoALP

This page was built for publication: A productivity checker for logic programming