Modular Answer Set Programming as a Formal Specification Language
From MaRDI portal
Publication:5140013
DOI10.1017/S1471068420000265zbMath1468.68119arXiv2008.02015MaRDI QIDQ5140013
Yuliya Lierler, Pedro Cabalar, Jorge Fandinno
Publication date: 13 December 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02015
Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)
Related Items (3)
Arguing correctness of ASP programs with aggregates ⋮ Semantics for conditional literals via the SM operator ⋮ Modular Answer Set Programming as a Formal Specification Language
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable models and circumscription
- Logic programs with stable model semantics as a constraint programming paradigm
- Characterising relativised strong equivalence with projection for non-ground answer-set programs
- Forgetting auxiliary atoms in forks
- Logic programs with propositional connectives and aggregates
- A Translation-based Approach to the Verification of Modular Equivalence
- Performance Tuning in Answer Set Programming
- You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
- Achievements in answer set programming
- First-order modular logic programs and their conservative extensions
- Modular Answer Set Programming as a Formal Specification Language
- A Tarskian Informal Semantics for Answer Set Programming
- Conflict-Driven Answer Set Enumeration
- A Characterization of Strong Equivalence for Logic Programs with Variables
- Logic Programming and Nonmonotonic Reasoning
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Strongly equivalent logic programs
This page was built for publication: Modular Answer Set Programming as a Formal Specification Language
