Modularity Aspects of Disjunctive Stable Models

by   Tomi Janhunen, et al.

Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we are interested in the area of answer-set programming where fully declarative and nonmonotonic languages are applied. In this context, obtaining a modular structure for programs is by no means straightforward since the output of an entire program cannot in general be composed from the output of its components. To better understand the effects of disjunctive information on modularity we restrict the scope of analysis to the case of disjunctive logic programs (DLPs) subject to stable-model semantics. We define the notion of a DLP-function, where a well-defined input/output interface is provided, and establish a novel module theorem which indicates the compositionality of stable-model semantics for DLP-functions. The module theorem extends the well-known splitting-set theorem and enables the decomposition of DLP-functions given their strongly connected components based on positive dependencies induced by rules. In this setting, it is also possible to split shared disjunctive rules among components using a generalized shifting technique. The concept of modular equivalence is introduced for the mutual comparison of DLP-functions using a generalization of a translation-based verification method.


page 1

page 2

page 3

page 4


Module Theorem for The General Theory of Stable Models

The module theorem by Janhunen et al. demonstrates how to provide a modu...

Generalizing Modular Logic Programs

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

On Signings and the Well-Founded Semantics

In this note, we use Kunen's notion of a signing to establish two theore...

Expressiveness of Logic Programs under General Stable Model Semantics

The stable model semantics had been recently generalized to non-Herbrand...

Relativized hyperequivalence of logic programs for modular programming

A recent framework of relativized hyperequivalence of programs offers a ...

Verifying Tight Logic Programs with anthem and Vampire

This paper continues the line of research aimed at investigating the rel...

Declarative Statistical Modeling with Datalog

Formalisms for specifying statistical models, such as probabilistic-prog...