Unary resolution: Characterizing PTIME

Clément Aubert, Marc Bagnol, Thomas Seiller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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. This construction stems from an interactive interpretation of the cut-elimination procedure of linear logic known as the geometry of interaction . This framework is restricted to terms (logic programs, rewriting rules) using only unary symbols, and this restriction is shown to be complete for polynomial time computation by encoding pushdown automata. Soundness w.r.t. Ptime is proven thanks to a saturationmethod similar to the one used for pushdown systems and inspired by the memoization technique. A Ptime-completeness result for a class of logic programming queries that uses only unary function symbols comes as a direct consequence.

Original languageEnglish (US)
Title of host publicationFoundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Proceedings
EditorsChristof Löding, Bart Jacobs
PublisherSpringer Verlag
Pages373-389
Number of pages17
ISBN (Print)9783662496299
DOIs
StatePublished - Jan 1 2016
Externally publishedYes
Event19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016 and Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016 - Eindhoven, Netherlands
Duration: Apr 2 2016Apr 8 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9634
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016 and Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016
CountryNetherlands
CityEindhoven
Period4/2/164/8/16

Keywords

  • Geometry of interaction
  • Implicit complexity
  • Logic programming
  • Memoization
  • Proof theory
  • Pushdown automata
  • Saturation
  • Unary queries

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Unary resolution: Characterizing PTIME'. Together they form a unique fingerprint.

  • Cite this

    Aubert, C., Bagnol, M., & Seiller, T. (2016). Unary resolution: Characterizing PTIME. In C. Löding, & B. Jacobs (Eds.), Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Proceedings (pp. 373-389). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9634). Springer Verlag. https://doi.org/10.1007/978-3-662-49630-5_22