Co-Logic Programming: Extending Logic Programming with Coinduction

DOI10.1007/978-3-540-73420-8_42MaRDI QIDQ5428832zbMATH OpenOpenAlexFDO

Authors Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_42

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Coinductive Logic Programming and Its Applications
• Infinite computation, co-induction and computational logic
• Coinductive constraint logic programming
• Coinductive Logic Programming
• Extending co-logic programs for branching-time model checking

Cited in

(41)

• Logic programming: laxness and saturation
• Preemptive type checking
• Integrating induction and coinduction via closure operators and proof cycles
• Enhancing expressivity of checked corecursive streams
• On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
• Operational semantics of resolution and productivity in Horn clause logic
• Proof relevant corecursive resolution
• Chosen-ciphertext security from subset sum
• Coinductive constraint logic programming
• Generalizing inference systems by coaxioms
• Idealized coinductive type systems for imperative object-oriented programs
• Coalgebraic semantics for parallel derivation strategies in logic programming
• Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?
• Infinite computation, co-induction and computational logic
• scientific article; zbMATH DE number 7037626 (Why is no real title available?)
• A theoretical perspective of coinductive logic programming
• Towards coinductive theory exploration in Horn clause logic: position paper
• Extending co-logic programs for branching-time model checking
• A logical encoding of timed \(\pi\)-calculus
• Coinductive logic programming with negation
• Coinductive Logic Programming and Its Applications
• Type Inference by Coinductive Logic Programming
• Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
• Productive corecursion in logic programming
• Program equivalence by circular reasoning
• Foundations of regular coinduction
• Flexible coinductive logic programming
• Coinductive Logic Programming
• Category theoretic semantics for theorem proving in logic programming: embracing the laxness
• Coalgebraic logic programming: from Semantics to Implementation
• On dual programs in co-logic programming
• Coinduction in Flow: The Later Modality in Fibrations
• Deconfined Global Types for Asynchronous Sessions
• Checked corecursive streams: expressivity and completeness
• Proof-theoretic foundations of normal logic programs
• Checking equivalence of corecursive streams: an inductive procedure
• Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
• Partially typed multiparty sessions with internal delegation
• Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses
• Open compliance in multiparty sessions with partial typing
• Some techniques for reasoning automatically on co-inductive data structures

Describes a project that uses

Uses Software

• Kernel-LEAF
• OPTYap

This page was built for publication: Co-Logic Programming: Extending Logic Programming with Coinduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428832)