Name
Abstract | ||
|---|---|---|
We present a methodology for proving that any program transformation which preserves the least Herbrand model semantics when applied to sets of Horn clauses also preserves all semantics for normal logic programming that can be formulated in argumentation-theoretic terms [3, 4, 16]. These include stable model, partial stable model, preferred extension, stationary expansion, complete scenaria, stable theory, acceptability and well-founded semantics. We apply our methodology to prove that (some forms of) unfolding, folding and goal replacement preserve all these semantics. We also show the relationship of our methodology to that of Aravindan and Dung [1]. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-60939-3_5 | LOPSTR |
Keywords | Field | DocType |
argumentation-theoretic approach,logic program transformation | Logic synthesis,Argumentation framework,Horn clause,Program transformation,Computer science,Argumentation theory,Theoretical computer science,Logic programming,Semantics,Dynamic logic (modal logic) | Conference |
ISBN | Citations | PageRank |
3-540-60939-3 | 1 | 0.36 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesca Toni | 1 | 291 | 33.16 |
| Robert A. Kowalski | 2 | 4187 | 1066.36 |