Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for smaller programs. This idea is extended here to the general theory of stable models that replaces traditional logic programs by arbitrary first-order sentences and distinguishes between intensional and extensional predicates. We discuss two kinds of splitting: a set of intensional predicates can be split into subsets, and a formula can be split into its conjunctive terms.

PDF

In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 797-803, 2009.

@inproceedings{fer09a, title={Symmetric Splitting in the General Theory of Stable Models}, author={Paolo Ferraris and Joohyung Lee and Vladimir Lifschitz and Ravi Palla}, booktitle={Proceedings of International Joint Conference on Artificial Intelligence (IJCAI)}, pages={797-803}, url="http://www.cs.utexas.edu/users/ai-lab/?fer09a", year={2009} }