作者: Minh Dao-Tran , Thomas Eiter , Michael Fink , Thomas Krennwallner
DOI: 10.1007/978-3-642-02846-5_16
关键词: Higher-order logic 、 Answer set programming 、 Logic programming 、 Stable model semantics 、 Well-founded semantics 、 Horn clause 、 Theoretical computer science 、 Computational logic 、 Computer science 、 Functional logic programming
摘要: Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under 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 extended setting, show that many desired properties ordinary programming generalize our ASP, and determine computational complexity new formalism. investigate relationship disjunctive with well-defined input/output interface (DLP-functions) they can be embedded into MLPs.