Logic programming and negation : a survey
Krzysztof Rafal Apt, Roland N. Bol · UvA-DARE (University of Amsterdam) · 1994
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the proof-theoretic and model-theoretic issues and the relationships between them. 1991 Mathematics Subject Classification: 68Q40, 68T15. CR Categories: F.3.2., F.4.1, H.3.3, I.2.3. Keywords and Phrases: negation, general logic programs, non-monotonic reasoning. Notes. The work of the first author was partly supported by ESPRIT Basic Research Action 6810 (Compulog 2). The work of the second author was partly supported by the Netherlands Organization for Scientific Research (NWO). 1 Introduction 1.1 Motivation Non-monotonic reasoning grew out of attempts to capture the essential aspects of commonsense reasoning. It resulted in a number of important formalisms, the most known of them being the circumscription method of McCarthy [107], the default theory of Reiter [145] and autoepistemic logic of Moore [111]. (For a systematic comparison of these approaches see the rec...