Google Research

Symmetric Splitting in the General Theory of Stable Models

  • Paolo Ferraris
  • Joohyung Lee
  • Vladimir Lifschitz
  • Ravi Palla
In proc. Twenty-first International Joint Conference on Artificial Intelligence (IJCAI '09) (2009), pp. 797-803

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

Research Areas

Learn more about how we do research

We maintain a portfolio of research projects, providing individuals and teams the freedom to emphasize specific types of work