English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Context Unification is in PSPACE

Jeż, A. (2014). Context Unification is in PSPACE. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds.), Automata, Languages, and Programming (pp. 244-255). Berlin: Springer. doi:10.1007/978-3-662-43951-7_21.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-55A0-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-AAE9-4
Genre: Conference Paper
Latex : Context Unification is in {PSPACE}

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Jeż, Artur1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: Contexts are terms with one `hole', i.e. a place in which we can substitute an argument. In context unification we are given an equation over terms with variables representing contexts and ask about the satisfiability of this equation. Context unification at the same time is subsumed by a second-order unification, which is undecidable, and subsumes satisfiability of word equations, which is in PSPACE. We show that context unification is in PSPACE, so as word equations. For both problems NP is still the best known lower-bound. This result is obtained by an extension of the recompression technique, recently developed by the author and used in particular to obtain a new PSPACE algorithm for satisfiability of word equations, to context unification. The recompression is based on applying simple compression rules (replacing pairs of neighbouring function symbols), which are (conceptually) applied on the solution of the context equation and modifying the equation in a way so that such compression steps can be performed directly on the equation, without the knowledge of the actual solution.

Details

show
hide
Language(s): eng - English
 Dates: 20142014-07
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-662-43951-7_21
BibTex Citekey: Jez2014ICALP
 Degree: -

Event

show
hide
Title: 41st International Colloquium on Automata, Languages, and Programming
Place of Event: Copenhagen, Denmark
Start-/End Date: 2014-07-08 - 2014-07-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata, Languages, and Programming
  Subtitle : 41st International Colloquium, ICALP 2014 ; Copenhagen, Denmark, July 8-11, 2014 ; Proceedings, Part II
  Abbreviation : ICALP 2014
Source Genre: Proceedings
 Creator(s):
Esparza, Javier1, Editor           
Fraigniaud, Pierre1, Editor
Husfeldt, Thore1, Editor
Koutsoupias, Elias1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 244 - 255 Identifier: ISBN: 978-3-662-43950-0

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 8573 Sequence Number: - Start / End Page: - Identifier: -