A correct top-down proof procedure for a general logic program with integrity constraints:

Abstract: "We present a correct top-down procedure for every general logic program with integrity constraints. Recently, stable model semantics [4] of logic programs was proposed and has been investigated intensively. Although there are correct bottom-up procedures for every general logic progr...

Full description

Saved in:
Bibliographic Details
Main Authors: Satoh, Ken 1959- (Author), Iwayama, Noboru (Author)
Format: Book
Language:English
Published: Tokyo, Japan 1992
Series:Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 739
Subjects:
Summary:Abstract: "We present a correct top-down procedure for every general logic program with integrity constraints. Recently, stable model semantics [4] of logic programs was proposed and has been investigated intensively. Although there are correct bottom-up procedures for every general logic program [10, 3, 12] based on stable models, there are no proposed correct top-down procedure for every general logic program. Our proposed procedure is correct not only for successful derivation but also for finite failure. This procedure is an extension of Eshghi's procedure [2] which is correct for every call-consistent logic program, and can be regarded as a combination of the ancestor-resolution [8] and consistency checking in updates of implicit deletions [11]."
Physical Description:16 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!