Arguing correctness of ASP programs with aggregates

DOI10.1007/978-3-031-15707-3_15MaRDI QIDQ2694567zbMATH OpenOpenAlexFDO

Authors Zachary Hansen, Yuliya Lierler, Jorge Fandinno

Publication date 4 April 2023

Full work available at URL https://doi.org/10.1007/978-3-031-15707-3_15

zbMATH Keywords

program verificationASPaggregate semanticsmodular proofs of correctness

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites work

• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• Abstract gringo
• Logic programs with stable model semantics as a constraint programming paradigm
• Modular answer set programming as a formal specification language
• Performance tuning in answer set programming
• Stable models and circumscription
• Verifying Tight Logic Programs with anthem and vampire

Cited in

(3)

• Look-back techniques for ASP programs with aggregates
• ASP programs with groundings of small treewidth
• Semantics for conditional literals via the SM operator

Describes a project that uses

Uses Software

• Gringo

This page was built for publication: Arguing correctness of ASP programs with aggregates

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