ACM Transactions on Programming Languages and Systems (TOPLAS)
Modularity in logic programming
Proceedings of the eleventh international conference on Logic programming
Proceedings of the eleventh international conference on Logic programming
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Modularity aspects of disjunctive stable models
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
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
Rules with contextually scoped negation
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
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Theory and Practice of Logic Programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Communicating ASP and the polynomial hierarchy
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Modularity in the rule interchange format
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Answer set programming at a glance
Communications of the ACM
Answer set modules for logical agents
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
First-order extension of the FLP stable model semantics via modified circumscription
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
| Hi-index | 0.02 |
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually dependent input provided by other modules. Moreover, (mutually) recursive module calls are allowed. We define a model-theoretic semantics for this extended setting, show that many desired properties of ordinary logic programming generalize to our modular ASP, and determine the computational complexity of the new formalism. We investigate the relationship of modular programs to disjunctive logic programs with well-defined input/output interface (DLP-functions) and show that they can be embedded into MLPs.