Logic Programming and Logarithmic Space - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Logic Programming and Logarithmic Space

Résumé

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 non-deterministic) computation is given via a syntactic 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 two-ways multi-head finite automata, a kind of pointer machine that is a standard model of logarithmic space computation.
Fichier principal
Vignette du fichier
logic-programming-and-logarithmic-space.pdf (572.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01309159 , version 1 (29-04-2016)

Licence

Licence Ouverte - etalab

Identifiants

Citer

Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller. Logic Programming and Logarithmic Space. 12th Asian Symposium, APLAS 2014, Oct 2014, Singapour, Singapore. pp.39-57, ⟨10.1007/978-3-319-12736-1_3⟩. ⟨hal-01309159⟩
269 Consultations
107 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More