On Heuer's procedure for verifying strong equivalence

DOI10.1007/978-3-031-43619-2_18MaRDI QIDQ6545537zbMATH OpenFDO

Authors Jorge Fandinno, Vladimir Lifschitz

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43619-2_18

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Verifying strong equivalence of programs in the input language of \textsc{gringo}
• Strong Equivalence of Logic Programs with Counting
• Strongly equivalent logic programs
• Logic Programming and Nonmonotonic Reasoning
• Here and There with Arithmetic

Cites work

• A Characterization of Strong Equivalence for Logic Programs with Variables
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Characterization of strongly equivalent logic programs in intermediate logics
• Discovering classes of strongly equivalent logic programs
• Here and There with Arithmetic
• scientific article; zbMATH DE number 3250542 (Why is no real title available?)
• Infinitary Equilibrium Logic and Strong Equivalence
• Infinitary equilibrium logic and strongly equivalent logic programs
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Propositional theories are strongly equivalent to logic programs
• Stable models and circumscription
• Strong equivalence made easy: nested expressions and weight constraints
• Strong Equivalence of Logic Programs with Counting
• Strongly equivalent logic programs
• Termination of grounding is not preserved by strongly equivalent transformations
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• Transforming gringo rules into formulas in a natural way
• Verifying strong equivalence of programs in the input language of \textsc{gringo}
• Verifying Tight Logic Programs with anthem and vampire
• Yet another characterization of strong equivalence

Cited in

(2)

• Generalizing the syntax of terms in mini-\textsc{gringo}
• Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic

This page was built for publication: On Heuer's procedure for verifying strong equivalence

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