Unary Resolution: Characterizing Ptime

@inproceedings{Aubert2016UnaryRC,
  title={Unary Resolution: Characterizing Ptime},
  author={Cl{\'e}ment Aubert and Marc Bagnol and Thomas Seiller},
  booktitle={FoSSaCS},
  year={2016}
}
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), a construction stemming from an interactive interpretation of cut-elimination known as the geometry of interaction. More precisely, we restrict this framework to terms (logic programs, rewriting rules) using only unary symbols. We prove it is complete for… CONTINUE READING