Memoization for Unary Logic Programming: Characterizing PTIME

Abstract

We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules over first-order terms. More precisely, we study the restriction of this framework to terms (and logic programs, rewriting rules) using only… (More)

Topics

Cite this paper

@article{Aubert2015MemoizationFU, title={Memoization for Unary Logic Programming: Characterizing PTIME}, author={Cl{\'e}ment Aubert and Marc Bagnol and Thomas Seiller}, journal={CoRR}, year={2015}, volume={abs/1501.05104} }