One Context Unification Problems Solvable in Polynomial Time

被引：2

作者：

Gascon, Adria ^{[1
]}

Tiwari, Ashish ^{[1
]}

Schmidt-Schauss, Manfred ^{[2
]}

机构：

[1] SRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USA

[2] Goethe Univ Frankfurt, Frankfurt, Germany

来源：

2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) | 2015年

基金：

美国国家科学基金会;

关键词：

2ND-ORDER UNIFICATION; WORD EQUATIONS; COMPLEXITY;

D O I：

10.1109/LICS.2015.53

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

One context unification extends first-order unification by introducing a single context variable, possibly with multiple occurrences. One context unification is known to be in NP, but it is not known to be solvable in polynomial time. In this paper, we present a polynomial time algorithm for certain interesting classes of the one context unification problem. Our algorithm is presented as an inference system that non-trivially extends the usual inference rules for first-order unification. The algorithm is of independent value as it can be used, with slight modifications, to solve other problems, such as the first-order unification problem that tolerates one clash.

引用

页码：499 / 510

页数：12

共 50 条

[1] A CLASS OF LINEAR COMPLEMENTARITY-PROBLEMS SOLVABLE IN POLYNOMIAL-TIME
YE, YY
PARDALOS, PM
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 152 : 3 - 17
[2] Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems
Himmel, Anne-Sophie
Mertzios, George B.
Nichterlein, Andre
Niedermeier, Rolf
[J]. COMMUNICATIONS OF THE ACM, 2024, 67 (04) : 67 - 76
[3] Context unification with one context variable
Gascon, Adria
Godoy, Guillem
Schmidt-Schauss, Manfred
Tiwari, Ashish
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 2010, 45 (02) : 173 - 193
[4] Structured p-facility location problems on the line solvable in polynomial time
Hsu, VN
Lowe, TJ
Tamir, A
[J]. OPERATIONS RESEARCH LETTERS, 1997, 21 (04) : 159 - 164
[5] Structured p-facility location problems on the line solvable in polynomial time
George Mason Univ, Fairfax, United States
[J]. Oper Res Lett, 4 (159-164):
[6] Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies
Chrpa, Lukas
Bartak, Roman
[J]. TENTH SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2008, 173 : 175 - 180
[7] Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits
Margulies, S.
Morton, J.
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 2016, 74 : 152 - 180
[8] Unification algorithms cannot be combined in polynomial time
Hermann, M
Kolaitis, PG
[J]. INFORMATION AND COMPUTATION, 2000, 162 (1-2) : 24 - 42
[9] Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems
Gu, Shenshen
Cui, Rui
Peng, Jiao
[J]. NEUROCOMPUTING, 2016, 198 : 171 - 179
[10] A polynomial time solvable formulation of multiple sequence alignment
Sze, SH
Lu, Y
Yang, QW
[J]. RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2005, 3500 : 204 - 216

← 1 2 3 4 5 →