|
Abstract : |
Abstract. Recently, considerable interest and research effort has been given to the problem of finding a suitable extension of the logic programming paradigm beyond the class of normal logic programs. In order to demonstrate that a class of programs can be justifiably called an extension of logic programs one should be able to argue that: ffl the proposed syntax of such programs resembles the syntax of logic programs but it applies to a significantly broader class of programs; ffl the proposed semantics of such programs constitutes an intuitively natural extension of the semantics of normal logic programs; ffl there exists a reasonably simple procedural mechanism allowing, at least in principle, to compute the semantics; ffl the proposed class of programs and their semantics is a special case of a more general non-monotonic formalism which clearly links it to other well-established non-monotonic formalisms. In this paper we propose a specific class of extended logic programs which, |
