| Quasi-stable semantics for logic programs (1998) | |||||||||||||||
Abstract | |||||||||||||||
| scholarship. In this paper, we describe a new semantics for logic programs and deductive databases which we term the "quasi-stable semantics". This has the following features (i) every logic program has at least one quasistable model, (ii) a quasi-stable model of a logic program P is a total model of P, (iii) a quasi-stable model of P is minimal in the sense that no positive literal can be replaced in the model by a negative one without its ceasing to be a model of P, (iv) the well-founded partial model for a logic program P is included in every quasi-stable model of P, (v) every stable model is a quasi-stable model. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||