Paper Info
Title
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
Abstract
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input from other modules, while allowing (mutually) recursive module calls. This can be used for more succinct and natural problem representation at the price of an exponential increase of evaluation time. In this paper, we aim at an efficient top-down evaluation of MLPs, considering only calls to relevant module instances. To this end, we generalize the well-known Splitting Theorem to the MLP setting and present notions of call stratification, for which we determine sufficient conditions. Call-stratified MLPs allow to split module instantiations into two parts, one for computing input of module calls, and one for evaluating the calls themselves with subsequent computations. Based on these results, we develop a top-down evaluation procedure that expands only relevant module instantiations. Finally, we discuss syntactic conditions for its exploitation.
Year
DOI
Venue
2009
10.1007/978-3-642-04238-6_10
LPNMR
Keywords
Field
DocType
relevant module instantiations,efficient top-down evaluation,top-down evaluation procedure,relevance-driven evaluation,relevant module instance,module instantiations,modular nonmonotonic logic programs,evaluation time,call-stratified mlps,module call,recursive module call,context-dependent input,nonmonotonic logic,context dependent,top down,stratification
Programming language,Splitting theorem,Computer science,Algorithm,Theoretical computer science,Non-monotonic logic,Formalism (philosophy),Modular design,Syntax,Recursion,Semantics,Computation
Conference
Volume
ISSN
Citations 
5753
0302-9743
3
PageRank 
References 
Authors
0.37
14
4
Name
Order
Citations
PageRank
Minh Dao-Tran139520.39
Thomas Eiter27238532.10
Michael Fink3114562.43
Thomas Krennwallner446829.14