International Conference on Rewriting Techniques and Applications

RTA 2014: Rewriting and Typed Lambda Calculi pp 179-193

An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting

  • Daniel de Carvalho
  • Jakob Grue Simonsen
Conference paper

DOI: 10.1007/978-3-319-08918-8_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8560)
Cite this paper as:
de Carvalho D., Simonsen J.G. (2014) An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting. In: Dowek G. (eds) Rewriting and Typed Lambda Calculi. RTA 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham

Abstract

We define the class of constrained cons-free rewriting systems and show that this class characterizes P, the set of languages decidable in polynomial time on a deterministic Turing machine. The main novelty of the characterization is that it allows very liberal properties of term rewriting, in particular non-deterministic evaluation: no reduction strategy is enforced, and systems are allowed to be non-confluent.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Daniel de Carvalho
    • 1
  • Jakob Grue Simonsen
    • 1
  1. 1.Department of Computer ScienceUniversity of Copenhagen (DIKU)Copenhagen SDenmark

Personalised recommendations