DeepAI AI Chat
Log In Sign Up

Module Theorem for The General Theory of Stable Models

by   Joseph Babb, et al.

The module theorem by Janhunen et al. demonstrates how to provide a modular structure in answer set programming, where each module has a well-defined input/output interface which can be used to establish the compositionality of answer sets. The theorem is useful in the analysis of answer set programs, and is a basis of incremental grounding and reactive answer set programming. We extend the module theorem to the general theory of stable models by Ferraris et al. The generalization applies to non-ground logic programs allowing useful constructs in answer set programming, such as choice rules, the count aggregate, and nested expressions. Our extension is based on relating the module theorem to the symmetric splitting theorem by Ferraris et al. Based on this result, we reformulate and extend the theory of incremental answer set computation to a more general class of programs.


page 1

page 2

page 3

page 4


Grounding Bound Founded Answer Set Programs

To appear in Theory and Practice of Logic Programming (TPLP) Bound Fou...

Modularity Aspects of Disjunctive Stable Models

Practically all programming languages allow the programmer to split a pr...

Logic Programming with Ordered Disjunction

Logic programs with ordered disjunction (LPODs) combine ideas underlying...

Generalizing Modular Logic Programs

Even though modularity has been studied extensively in conventional logi...

Number Theory meets Wireless Communications: an introduction for dummies like us

In this chapter we introduce the theory of Diophantine approximation via...

Incremental Answer Set Programming with Overgrounding

Repeated executions of reasoning tasks for varying inputs are necessary ...

A System for Interactive Query Answering with Answer Set Programming

Reactive answer set programming has paved the way for incorporating onli...