Verifying strong equivalence of programs in the input language of \textsc{gringo}

DOI10.1007/978-3-030-20528-7_20MaRDI QIDQ2326735zbMATH OpenOpenAlexFDO

Authors Patrick Lühne, Torsten Schaub, Vladimir Lifschitz

Publication date 10 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-20528-7_20

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Strongly equivalent logic programs
• Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
• Verifying Tight Logic Programs with anthem and vampire
• Logic Programming and Nonmonotonic Reasoning
• scientific article; zbMATH DE number 2090116

Cited in

(15)

• Transforming gringo rules into formulas in a natural way
• Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
• Termination of grounding is not preserved by strongly equivalent transformations
• Program completion in the input language of GRINGO
• Abstract gringo
• scientific article; zbMATH DE number 7455713 (Why is no real title available?)
• Strong Equivalence of Logic Programs with Counting
• Towards Verifying Logic Programs in the Input Language of clingo
• Verifying Tight Logic Programs with anthem and vampire
• Here and There with Arithmetic
• Answer set programming made easy
• On Heuer's procedure for verifying strong equivalence
• Generalizing the syntax of terms in mini-\textsc{gringo}
• On program completion, with an application to the sum and product puzzle
• Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic

Describes a project that uses

Uses Software

• VAMPIRE
• anthem
• Gringo
• TPTP

This page was built for publication: Verifying strong equivalence of programs in the input language of \textsc{gringo}

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