Negation as Failure through a Network

Kazunori IRIYA  Susumu YAMASAKI  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E87-D   No.5   pp.1200-1207
Publication Date: 2004/05/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computation and Computational Models
Keyword: 
SLDNF resolution,  distributed computing,  

Full Text: PDF>>
Buy this Article




Summary: 
This paper deals with distributed procedures, caused by negation as failure through a network, where general logic programs are distributed so that they communicate with each other in terms of negation as failure inquiries and responses, but not in terms of derivations of SLD resolutions. The common variables as channels in share for distributed programs are not treated, but negation as failure validated in the whole network is the object for communications of distributed programs. We can define the semantics for the distributed programs in a network. At the same time, we have distributed proof procedures for distributed programs, by means of negation as failure to be implemented through the network, where the soundness of the procedure is guaranteed by the defined semantics.