Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs

DOI10.1017/s1471068421000545zbMath1530.68056arXiv1901.09127MaRDI QIDQ6063883

Yuliya Lierler

Publication date: 12 December 2023

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

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

zbMATH Keywords

program analysisessential equivalence

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synonymous theories and knowledge representations in answer set programming
• Stable models and circumscription
• Cut-free formulations for a quantified logic of here and there
• Nonmonotonic causal theories
• Propositional semantics for disjunctive logic programs
• Nested expressions in logic programs
• Estimating grounding sizes of logic programs under answer set semantics
• A bird's-eye view of forgetting in answer-set programming
• Lpopt: a rule optimization tool for answer set programming
• Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set Programming
• Performance Tuning in Answer Set Programming
• Abstract gringo
• First-order modular logic programs and their conservative extensions
• Weight constraints as nested expressions
• Logic Programming
• Logic Programming
• Logics in Artificial Intelligence
• Modularity Aspects of Disjunctive Stable Models
• A Characterization of Strong Equivalence for Logic Programs with Variables
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Logic Programming and Nonmonotonic Reasoning
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Strongly equivalent logic programs