Logic Programming and Logarithmic Space
Abstract
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and nondeterministic) computation is given via a synctactic restriction, using an encoding of words that derives from proof theory. We show that the acceptance of a word by an observation (the counterpart of a program in the encoding) can be decided within logarithmic space, by reducing this problem to the acyclicity of a graph. We show moreover that observations are as expressive as twoways multiheads finite automata, a kind of pointer machines that is a standard model of logarithmic space computation.
 Publication:

arXiv eprints
 Pub Date:
 June 2014
 arXiv:
 arXiv:1406.2110
 Bibcode:
 2014arXiv1406.2110A
 Keywords:

 Computer Science  Logic in Computer Science