Name
Abstract | ||
|---|---|---|
Recently Modular Nonmonotonic Logic Programs (MLP) have been introduced which incorporate a call-by-value mechanism and allow for unrestricted calls between modules, including mutual and self recursion, as an approach to provide module constructs akin to those in conventional programming in Nonmonotonic Logic Programming under Answer Set Semantics. This paper considers MLPs in a Datalog setting and provides characterizations of their answers sets in terms of classical (Herbrand) models of a first-order formula, extending a line of research for ordinary logic programs. To this end, we lift the well-known loop formulas method to MLPs, and we also consider the recent ordered completion approach that avoids explicit construction of loop formulas using auxiliary predicates. Independent of computational perspectives, the novel characterizations widen our understanding of MLPs and they may prove useful for semantic investigations. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-24206-9_4 | Datalog |
Keywords | Field | DocType |
completion approach,first-order encodings,call-by-value mechanism,answer set semantics,loop formula,auxiliary predicate,well-known loop formulas method,modular nonmonotonic datalog program,answers set,nonmonotonic logic programming,modular nonmonotonic logic programs,datalog setting | Programming language,First order,Computer science,Theoretical computer science,Non-monotonic logic,Predicate (grammar),Modular design,Datalog,Semantics,Recursion | Conference |
Volume | ISSN | Citations |
6702 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 18 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minh Dao-Tran | 1 | 395 | 20.39 |
| Thomas Eiter | 2 | 7238 | 532.10 |
| Michael Fink | 3 | 1145 | 62.43 |
| Thomas Krennwallner | 4 | 468 | 29.14 |