Published in Volume XIII, 2003, pages 127-142

Authors: Victor FELEA


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 TP,v corresponds to the operator TP defined by A. Gelder, K. Ross and J. Schlipf. The second one, denoted Mv, is like the operator U defined by the same authors. For a truth value v from L, using the two operators TP,v and Mv, a new operator Wv is defined for the program P. The fixed points of Wv 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.


  title={On Well-Founded Models for Logic Programs.},
  author={Victor FELEA},
  journal={Scientific Annals of Computer Science},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  publisher={``A.I. Cuza'' University Press}