Arguing correctness of ASP programs with aggregates

DOI10.1007/978-3-031-15707-3_15OpenAlexW4293179575MaRDI QIDQ2694567

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)

Related Items (1)

Semantics for conditional literals via the SM operator

Uses Software

• Gringo

Cites Work

• Unnamed Item
• Stable models and circumscription
• Logic programs with stable model semantics as a constraint programming paradigm
• Performance Tuning in Answer Set Programming
• Abstract gringo
• Verifying Tight Logic Programs with anthem and vampire
• Modular Answer Set Programming as a Formal Specification Language

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