Strong Equivalence of Logic Programs with Counting

DOI10.1017/S1471068422000278MaRDI QIDQ5038462

Vladimir Lifschitz

Publication date: 30 September 2022

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

Full work available at URL: https://arxiv.org/abs/2205.07783

zbMATH Keywords

answer set programmingaggregatesstrong equivalence

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Gringo
• GitHub

Cites Work

• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Logic programs with stable model semantics as a constraint programming paradigm
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Verifying strong equivalence of programs in the input language of \textsc{gringo}
• Infinitary equilibrium logic and strongly equivalent logic programs
• Connecting First-Order ASP and the Logic FO(ID) through Reducts
• Abstract gringo
• Answer Set Programming
• Strongly equivalent logic programs

This page was built for publication: Strong Equivalence of Logic Programs with Counting