A Translation-based Approach to the Verification of Modular Equivalence

DOI10.1093/LOGCOM/EXN039MaRDI QIDQ3395261zbMATH OpenOpenAlexFDO

Authors Emilia Oikarinen, Tomi Janhunen

Publication date 24 August 2009

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exn039

zbMATH Keywords

answer set programmingcompositionality of stable model semanticsmodular program developmentmodule theoremtranslation-based verification method

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
• Modular answer set programming as a formal specification language
• scientific article; zbMATH DE number 1931684
• Modularity in smodels Programs
• Logic Programming and Nonmonotonic Reasoning

Cited in

(5)

• The verification of modules
• Verifying Tight Logic Programs with anthem and vampire
• Modular answer set programming as a formal specification language
• Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
• Verification Modulo theories

Describes a project that uses

Uses Software

• clasp

This page was built for publication: A Translation-based Approach to the Verification of Modular Equivalence

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