Completed logic programs and their consistency

The Journal of Logic Programming - Tập 9 Số 1 - Trang 33-44 - 1990
Taisuke Sato

Tóm tắt

Từ khóa


Tài liệu tham khảo

Apt, 1988, Towards a Theory of Declarative Knowledge

Bell, 1974

Cavedon, 1987, Completeness Results for SLDNF-Resolution

Clark, 1978, Negation as Failure

Fitting, 1985, A Kripke-Kleene Semantics for Logic Programs, J. Logic Programming, 2, 10.1016/S0743-1066(85)80005-4

Jaffar, 1983, Completeness of Negation as Failure Rule, IJCAI-8

Kunen, 1987, Signed Data Dependencies in Logic Programs

Kunen, 1987, Negation in Logic Programming, J. Logic Programming, 4, 10.1016/0743-1066(87)90007-0

Lloyd, 1984, Foundations of Logic Programming

Lloyd, J. W., private communication, 1987.

1988

Przymusinski, 1988, On the Declarative Semantics of Deductive Databases and Logic Programs

Sato, 1987, On Consistency of First Order Logic Programs

Shepherdson, 1984, Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption, J. Logic Programming, 1, 10.1016/0743-1066(84)90023-2