@inproceedings{bbe151e1641b4fe5a132159650f13916,
title = "SM-Based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic",
abstract = "Modern answer set programming solvers such as clingo support advanced language constructs that improve the expressivity and conciseness of logic programs. Conditional literals are one such construct. They form {\textquotedblleft}subformulas{\textquotedblright} that behave as nested implications within the bodies of logic rules. Their inclusion brings the form of rules closer to the less restrictive syntax of first-order logic. These qualities make conditional literals useful tools for knowledge representation. In this paper, we propose a semantics for logic programs with conditional literals and arithmetic based on the SM operator. These semantics do not require grounding, unlike the established semantics for such programs that relies on a translation to infinitary propositional logic. The main result of this paper establishes the precise correspondence between the proposed and existing semantics.",
keywords = "Answer Set Programming, Conditional Literals, Semantics",
author = "Zachary Hansen and Yuliya Lierler",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.; 27th International Symposium on Practical Aspects of Declarative Languages, PADL 2025 ; Conference date: 20-01-2025 Through 21-01-2025",
year = "2025",
doi = "10.1007/978-3-031-84924-4\_5",
language = "English",
isbn = "9783031849237",
series = "Lecture Notes in Computer Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "71--87",
editor = "Esra Erdem and Germ{\'a}n Vidal",
booktitle = "Practical Aspects of Declarative Languages - 27th International Symposium, PADL 2025, Proceedings",
address = "Germany",
}