SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic

This conference talk presents research on SM-based semantics for answer set programming with conditional literals and arithmetic at the 27th International Symposium on Practical Aspects of Declarative Languages. Explore how researchers Zachary Hansen and Yuliya Lierler from the University of Nebraska develop a new approach to semantics for logic programs that incorporate conditional literals—advanced language constructs that improve expressivity and conciseness by functioning as nested implications within rule bodies. Learn about their proposed semantics based on the SM operator that doesn't require grounding, unlike established approaches that rely on translations to infinitary propositional logic. The presentation establishes the correspondence between the proposed and existing semantics, offering valuable insights for knowledge representation in answer set programming. This 27-minute talk is part of the PADL 2025 conference sponsored by ACM SIGPLAN.