Proving Program Properties by Means of SLS-Resolution
暂无分享,去创建一个
In order to design software that is intended to compute answers to queries that are in accordance with some logic programming semantics, one would like to offer up a formal specification of the software design which could be used profitably to construct the software, and one would want to be able to prove that the specification is in fact faithful to the semantics. This paper presents a constructive formal specification of semantic trees and truth-value determinations using semantic trees for disjunctive logic programs with negation as failure. This specification methodology directly supports the design of top-down interpreters for well-founded semantics.
[1] A. Bruffaerts,et al. Proof Trees for Negation as Failure: Yet Another Prolog Meta-Interpreter , 1988, ICLP/SLP.
[2] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[3] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[4] Michael R. Genesereth,et al. Logical foundations of artificial intelligence , 1987 .