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 Citations (Scopus)

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
StatePublished - 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)

Symmetric splitting in the general theory of stable models. / Ferraris, Paolo; Lee, Joohyung; Lifschitz, Vladimir; Palla, Ravi.

IJCAI International Joint Conference on Artificial Intelligence. 2009. p. 797-803.

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

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, 21st International Joint Conference on Artificial Intelligence, IJCAI-09, Pasadena, CA, United States, 7/11/09.
Ferraris P, Lee J, Lifschitz V, Palla R. Symmetric splitting in the general theory of stable models. In IJCAI International Joint Conference on Artificial Intelligence. 2009. p. 797-803
Ferraris, Paolo ; Lee, Joohyung ; Lifschitz, Vladimir ; Palla, Ravi. / Symmetric splitting in the general theory of stable models. IJCAI International Joint Conference on Artificial Intelligence. 2009. pp. 797-803
@inproceedings{2e6c4ec5c8334e2d9b92b5efb285b8cf,
title = "Symmetric splitting in the general theory of stable models",
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.",
author = "Paolo Ferraris and Joohyung Lee and Vladimir Lifschitz and Ravi Palla",
year = "2009",
language = "English (US)",
isbn = "9781577354260",
pages = "797--803",
booktitle = "IJCAI International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - Symmetric splitting in the general theory of stable models

AU - Ferraris, Paolo

AU - Lee, Joohyung

AU - Lifschitz, Vladimir

AU - Palla, Ravi

PY - 2009

Y1 - 2009

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

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

UR - http://www.scopus.com/inward/record.url?scp=78751688012&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78751688012&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:78751688012

SN - 9781577354260

SP - 797

EP - 803

BT - IJCAI International Joint Conference on Artificial Intelligence

ER -