Name
Abstract | ||
|---|---|---|
We present a version of the alternating fixpoint procedure that is fully incremental.Using ideas of partial evaluation techniques we can compute the well-founded model oflogic programs with negation bottom-up without any recomputations. Further extensionsof the semantics, e.g. to stable models or disjunctive programs are possible this way. Weshow how to implement the algorithm efficiently using index-based data structures and describean extension to handle magic set transformed programs.... |
Year | Venue | Keywords |
|---|---|---|
1996 | DDLP | partial evaluation,data structure,indexation,bottom up |
Field | DocType | Citations |
Modal μ-calculus,Programming language,Horn clause,Stable model semantics,Logic programming,Fixed point,Intermediate logic,Mathematics,Dynamic logic (modal logic) | Conference | 3 |
PageRank | References | Authors |
0.41 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ulrich Zukowski | 1 | 93 | 40.25 |
| Burkhard Freitag | 2 | 252 | 82.44 |