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

41 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-09 - Proceedings of the 21st International Joint Conference on Artificial Intelligence
PublisherInternational Joint Conferences on Artificial Intelligence
Pages797-803
Number of pages7
ISBN (Print)9781577354260
StatePublished - Jan 1 2009
Event21st International Joint Conference on Artificial Intelligence, IJCAI 2009 - Pasadena, United States
Duration: Jul 11 2009Jul 16 2009

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)1045-0823

Conference

Conference21st International Joint Conference on Artificial Intelligence, IJCAI 2009
CountryUnited States
CityPasadena
Period7/11/097/16/09

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this