A Data-Flow Network That Represents First-Order Logic for Inference

A method to represent first-order predicate logic (Horn clause logic) by a data-flow network is presented. Like a data-flow computer for a von Neumann program, the proposed network explicitly represents the logical structure of a declarative program by unlabeled edges and operation nodes. In the deduction, the network first propagates symbolic tokens to create an expanded AND/OR network by the backward deduction, and then executes unification by a newly developed method to solve simultaneous equations buried in the network. The paper argues the soundness and completeness of the network in a conventional way, then explains how a kind of ambiguous solution is obtained by the new developed method. To examine the method's convergence property, numerical experiments are also conducted with some simple data-flow networks.

[1]  Hiroyuki Ohsaki,et al.  A Network-Based Computational Model with Learning , 2010, UC.

[2]  Matthew Richardson,et al.  Markov logic networks , 2006, Machine Learning.

[3]  Pedro M. Domingos,et al.  Lifted First-Order Belief Propagation , 2008, AAAI.

[4]  Pedro M. Domingos,et al.  Learning the structure of Markov logic networks , 2005, ICML.

[5]  Jack B. Dennis,et al.  Data Flow Supercomputers , 1980, Computer.

[6]  David Poole,et al.  First-order probabilistic inference , 2003, IJCAI.

[7]  Yoshitaka Kameya,et al.  Parameter Learning of Logic Programs for Symbolic-Statistical Modeling , 2001, J. Artif. Intell. Res..

[8]  Tadao Murata,et al.  Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs , 1989, IEEE Trans. Software Eng..

[9]  Luc De Raedt,et al.  ProbLog: A Probabilistic Prolog and its Application in Link Discovery , 2007, IJCAI.

[10]  Jorge Lobo,et al.  A High-Level Petri Net for Goal-Directed Semantics of Horn Clause Logic , 1996, IEEE Trans. Knowl. Data Eng..

[11]  John A. Sharp,et al.  Data flow computing: theory and practice , 1992 .

[12]  Luc De Raedt,et al.  Lifted Probabilistic Inference by First-Order Knowledge Compilation , 2011, IJCAI.

[13]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[14]  Leon Sterling,et al.  The Art of Prolog - Advanced Programming Techniques , 1986 .

[15]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[16]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[17]  J. Nelson Rushton,et al.  Probabilistic reasoning with answer sets , 2004, Theory and Practice of Logic Programming.

[18]  Hiroyuki Ohsaki,et al.  Algorithmically Transitive Network: A Self-organizing Data-Flow Network with Learning , 2010, BIONETICS.

[19]  Dan Roth,et al.  Lifted First-Order Probabilistic Inference , 2005, IJCAI.

[20]  Ivan Bratko,et al.  Prolog Programming for Artificial Intelligence , 1986 .