## Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA (1997)

### Cached

### Download Links

- [www-b.informatik.uni-hannover.de]
- [www2.sis.pitt.edu]
- [www.uni-koblenz.de]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Automated Reasoning |

Citations: | 32 - 10 self |

### BibTeX

@INPROCEEDINGS{Brass97characterizationsof,

author = {Stefan Brass and Jürgen Dix},

title = {Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA},

booktitle = {Journal of Automated Reasoning},

year = {1997},

pages = {268--283},

publisher = {Springer, LNCS}

}

### Years of Citing Articles

### OpenURL

### Abstract

. Recently Brass and Dix have introduced the semantics D-WFS for general disjunctive logic programs. The interesting feature of this approach is that it is both semantically and proof-theoretically founded. Any program \Phi is associated a normalform res(\Phi), called the residual program, by a non-trivial bottom-up construction using least fixpoints of two monotonic operators. We show in this paper, that the original calculus, consisting of some simple transformations, has a very strong and appealing property: it is confluent and terminating. This means that all the transformations can be applied in any order: we always arrive at an irreducible program (no more transformation is applicable) and this program is already uniquely determined. Moreover, it coincides with the normalform res(\Phi) of the program we started with. The semantics D-WFS can be read off from res(\Phi) immediately. No proper subset of the calculus has these properties --- only when we restrict to certain subclasse...