Published in Volume XIII, 2003, pages 127-142

**Authors:** Victor FELEA

### Abstract

For a general logic program, a partial L-interpretation is defined, where L is a complete lattice of truth values. For a partial L-interpre-tation there is a unique family of disjoint sets on Herbrand base of the program P. The notions of weak L-model and L-model for P are defined. For the program P and a logic value v, two operators are defined. The first one, denoted by T_{P,v} corresponds to the operator T_{P} defined by A. Gelder, K. Ross and J. Schlipf. The second one, denoted M_{v}, is like the operator U defined by the same authors. For a truth value v from L, using the two operators T_{P,v} and M_{v}, a new operator W_{v} is defined for the program P. The fixed points of W_{v} constitute a new semantics of type well-founded for P and v on a complete lattice L. In the case the lattice L contains only true and false values, our well-founded semantics is more restrictive than the well-founded semantics.

### Bibtex

@article{sacscuza:felea2003owmflp, title={On Well-Founded Models for Logic Programs.}, author={Victor FELEA}, journal={Scientific Annals of Computer Science}, volume={13}, organization={``A.I. Cuza'' University, Iasi, Romania}, year={2003}, pages={127--142}, publisher={``A.I. Cuza'' University Press} }