Proving properties of co-logic programs with negation by program transformations

DOI10.1007/978-3-642-38197-3_14zbMATH Open1394.68057OpenAlexW64077253MaRDI QIDQ2848908FDOQ2848908

Authors: Hirohisa Seki 

Publication date: 13 September 2013

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38197-3_14

Recommendations

• Proving properties of co-logic programs by unfold/fold transformations
• On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
• On Inductive and Coinductive Proofs via Unfold/Fold Transformations
• On dual programs in co-logic programming
• Coinductive logic programming with negation

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (4)

• On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
• Proving properties of co-logic programs by unfold/fold transformations
• Extending co-logic programs for branching-time model checking
• On dual programs in co-logic programming

This page was built for publication: Proving properties of co-logic programs with negation by program transformations

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