A Translation-based Approach to the Verification of Modular Equivalence

DOI10.1093/LOGCOM/EXN039zbMATH Open1192.68131OpenAlexW2074596576MaRDI QIDQ3395261FDOQ3395261

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

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

zbMATH Keywords

answer set programmingmodular program developmentcompositionality of stable model semanticsmodule theoremtranslation-based verification method

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (5)

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

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)