Splitting Answer Set Programs with Respect to Intensionality Statements

Authors: Jorge Fandinno, Yuliya Lierler

AAAI 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We generalize the conditions under which this technique is applicable, by considering not only dependencies between predicates but also their arguments and context. This allows splitting programs commonly used in practice to which previous results were not applicable.The rest of the paper is organized as follows. After reviewing some preliminaries, we introduce the notion of intensionality statement. Then, we present the key ideas for the new Splitting Theorem in the context of logic programs. Finally, we generalize this result to first-order theories.
Researcher Affiliation Academia Jorge Fandinno* and Yuliya Lierler* University of Nebraska at Omaha {jfandinno,ylierler}@unomaha.edu
Pseudocode No The paper does not contain structured pseudocode or algorithm blocks.
Open Source Code No No concrete access to source code (specific repository link, explicit code release statement, or code in supplementary materials) for the methodology described in this paper was found.
Open Datasets No The paper is theoretical and does not describe experiments or use datasets, hence no information about public dataset availability is provided.
Dataset Splits No The paper is theoretical and does not describe experiments or use datasets, hence no information about training/validation/test splits is provided.
Hardware Specification No The paper is theoretical and does not describe experiments, therefore no hardware specifications are provided.
Software Dependencies No The paper is theoretical and does not describe experiments, therefore no specific software dependencies with version numbers are provided.
Experiment Setup No The paper is theoretical and does not describe experiments, therefore no specific experimental setup details are provided.