Flexible coinductive logic programming
From MaRDI portal
Abstract: Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations, necessary in some cases to get the correct meaning. We provide a detailed formal account of an extension of logic programming supporting flexible coinduction. Syntactically, programs are enriched by coclauses, clauses with a special meaning used to tune the interpretation of predicates. As usual, the declarative semantics can be expressed as a fixed point which, however, is not necessarily the least, nor the greatest one, but is determined by the coclauses. Correspondingly, the operational semantics is a combination of standard SLD resolution and coSLD resolution. We prove that the operational semantics is sound and complete with respect to declarative semantics restricted to finite comodels. This paper is under consideration for acceptance in TPLP.
Recommendations
- Coinductive Logic Programming
- Coinductive Logic Programming and Its Applications
- Coinductive constraint logic programming
- A theoretical perspective of coinductive logic programming
- Co-Logic Programming: Extending Logic Programming with Coinduction
- scientific article; zbMATH DE number 1670488
- Coalgebraic logic programming: from Semantics to Implementation
- Coinductive logic programming with negation
- scientific article; zbMATH DE number 1688813
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A productivity checker for logic programming
- A theoretical perspective of coinductive logic programming
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coalgebraic logic programming: from Semantics to Implementation
- Coinductive big-step operational semantics
- Coinductive Logic Programming
- Fundamental properties of infinite trees
- Generalizing inference systems by coaxioms
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- Infinite computation, co-induction and computational logic
- Iterative algebras at work
- Productive corecursion in logic programming
- Tabling, rational terms, and coinduction finally together!
- Transformation between regular expressions and \(\omega\)-automata
Cited in
(12)- Enhancing expressivity of checked corecursive streams
- Coinductive constraint logic programming
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- A theoretical perspective of coinductive logic programming
- scientific article; zbMATH DE number 2087695 (Why is no real title available?)
- Foundations of regular coinduction
- The new normal: we cannot eliminate cuts in coinductive calculi, but we can explore them
- Coinductive Logic Programming
- On dual programs in co-logic programming
- Checked corecursive streams: expressivity and completeness
- Classical (co)recursion: Mechanics
- Checking equivalence of corecursive streams: an inductive procedure
This page was built for publication: Flexible coinductive logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140017)
