Symmetric splitting in the general theory of stable models

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Scopus citations

Abstract

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 firstorder 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.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages797-803
Number of pages7
Publication statusPublished - 2009
Event21st International Joint Conference on Artificial Intelligence, IJCAI-09 - Pasadena, CA, United States
Duration: Jul 11 2009Jul 17 2009

Other

Other21st International Joint Conference on Artificial Intelligence, IJCAI-09
CountryUnited States
CityPasadena, CA
Period7/11/097/17/09

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Ferraris, P., Lee, J., Lifschitz, V., & Palla, R. (2009). Symmetric splitting in the general theory of stable models. In IJCAI International Joint Conference on Artificial Intelligence (pp. 797-803)