A New Execution Model for the logic of hereditary Harrop formulas

The class of first-order Hereditary Harrop formulas ($fohh$) is a well-established extension of first-order Horn clauses. Its operational semantics is based on intuitionistic provability. We propose another operational semantics for $fohh$ which is based on game semantics. This new semantics has several interesting aspects: in particular, it gives a logical status to the $read$ predicate in Prolog.

[1]  Giorgi Japaridze,et al.  Introduction to computability logic , 2003, Ann. Pure Appl. Log..

[2]  Giorgi Japaridze,et al.  Sequential operators in computability logic , 2007, Inf. Comput..

[3]  Gilles Kahn,et al.  Natural Semantics , 1987, STACS.

[4]  Kjell Post,et al.  Mutally Exclusive Rules in Logic Programming , 1994, ILPS.

[5]  Dale Miller,et al.  Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[6]  Gopalan Nadathur,et al.  Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..

[7]  Dale Miller,et al.  A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..