Semantic Scholar Open Access 1987 602 sitasi

Negation in Logic Programming

K. Kunen

Lihat Sumber DOI

Abstrak

Abstract We define a semantics for negation as failure in logic programming. Our semantics may be viewed as a cross between the approaches of Clark [5] and Fitting [7]. As does [7], our semantics corresponds well with real PROLOG in the standard examples used in the literature to illustrate problems with [5]. Also, PROLOG and the common variants of it are sound but not complete for our semantics. Unlike [7], our semantics is constructive, in that the set of supported queries is recursively enumerable. Thus, a complete interpreter exists in theory, although we point out that there are serious difficulties in building one that works well in practice.

Topik & Kata Kunci

Computer Science Mathematics

Penulis (1)

K. Kunen

Format Sitasi

APA MLA BibTeX

Kunen, K. (1987). Negation in Logic Programming. https://doi.org/10.1016/0743-1066(87)90007-0

Akses Cepat

Lihat di Sumber doi.org/10.1016/0743-1066(87)90007-0

Informasi Jurnal

Tahun Terbit: 1987
Bahasa: en
Total Sitasi: 602×
Sumber Database: Semantic Scholar
DOI: 10.1016/0743-1066(87)90007-0
Akses: Open Access ✓