Computing the Well-Founded Semantics for Constraint Extensions of Datalog

@inproceedings{Toman1997ComputingTW,
  title={Computing the Well-Founded Semantics for Constraint Extensions of Datalog},
  author={David Toman},
  booktitle={CDB},
  year={1997}
}
We present a new technique for computing the well-founded semantics for constraint extensions of Datalog :. The method is based on tabulated resolution enhanced with a new reenement strategy for deriving negative conclusions. This approach leads to an eecient and terminating query evaluation algorithm that preserves the goal-oriented nature of the resolution based methods.