External behavior of a logic program and verification of refactoring

DOI10.1017/S1471068423000200MaRDI QIDQ7027187zbMATH OpenFDO

Authors Jorge Fandinno, Zachary Hansen, Yuliya Lierler, Vladimir Lifschitz, Nathan Temple

Publication date 14 February 2025

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S1471068423000200

zbMATH Keywords

answer-set programmingautomated reasoningproof assistantsoftware verification

Mathematics Subject Classification ID

Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• Abstract gringo
• scientific article; zbMATH DE number 1926645 (Why is no real title available?)
• Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
• Performance tuning in answer set programming
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Strong Equivalence of Logic Programs with Counting
• Verifying Tight Logic Programs with anthem and vampire

Cited in

(3)

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

This page was built for publication: External behavior of a logic program and verification of refactoring

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