Modularity aspects of disjunctive stable models

Authors:
Tomi Janhunen;Emilia Oikarinen;Hans Tompits;Stefan Woltran
Affiliations:
Helsinki University of Technology, Department of Computer Science and Engineering, Finland;Helsinki University of Technology, Department of Computer Science and Engineering, Finland;Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria;Technische Universität Wien, Institut für Informationssysteme, Vienna, Austria
Venue:
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Year:
2007

Citing 12
Cited 14

Fully abstract compositional semantics for logic programs

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Splitting a logic program

Proceedings of the eleventh international conference on Logic programming
Disjunctive datalog

ACM Transactions on Database Systems (TODS)
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Modular Logic Programming and Generalized Quantifiers

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Automated Verification of Weak Equivalence within the smodels System*

Theory and Practice of Logic Programming
Modular Equivalence for Normal Logic Programs

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
On solution correspondences in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Effective integration of declarative rules with external evaluations for semantic-web reasoning

ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Macros, macro calls and use of ensembles in modular answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Magic sets and their application to data integration

ICDT'05 Proceedings of the 10th international conference on Database Theory

Implementing Prioritized Circumscription by Computing Disjunctive Stable Models

AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Relativized Hyperequivalence of Logic Programs for Modular Programming

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1

Theory and Practice of Logic Programming
Modular Equivalence in General

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Modular Nonmonotonic Logic Programming Revisited

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Symmetric splitting in the general theory of stable models

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Relativized hyperequivalence of logic programs for modular programming

Theory and Practice of Logic Programming
Logic programming for knowledge representation

ICLP'07 Proceedings of the 23rd international conference on Logic programming
A linear transformation from prioritized circumscription to disjunctive logic programming

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Modular answer set programming

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Using ASP for knowledge management with user authorization

Data & Knowledge Engineering
Answer set modules for logical agents

Datalog'10 Proceedings of the First international conference on Datalog Reloaded

Quantified Score

Hi-index	0.00

Visualization

Abstract

Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages, however, the modular structure of programs is hard to realise, since the output of an entire program cannot in general be composed from the output of its component programs in a direct manner. In this paper, we consider these aspects for the stable-model semantics of disjunctive logic programs (DLPs). We define the notion of a DLP-function, where a welldefined input/output interface is provided, and establish a novel module theorem enabling a suitable compositional semantics for modules. The module theorem extends the well-known splitting-set theorem and allows also a generalisation of a shifting technique for splitting shared disjunctive rules among components.