On the complexity of unification and disunification in commutative idempotent semigroups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 282-296

  Hermann, Miki ^a   Kolaitis, Phokion G ^b  

^a LORIA   (France)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION;

COUNTING PROBLEMS; DECISION PROBLEMS; EQUATIONAL THEORY; FREE CONSTANTS; MATCHING PROBLEMS; POLYNOMIAL-TIME; SPACE REDUCTIONS; TWO PARAMETER;

COMPUTATIONAL COMPLEXITY;

EID: 84948957160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017446     Document Type: Conference Paper

References (20)

1. [AGS96] N. Ami, S. Greco, and D. Saccà. Matching of bounded set terms in the logic language LDL++. J. Logic Prog., 27(l):73-87, 1996.
2. [BB88] F. Baader and W, Büttner. Unification in commutative idempotent monoids. Theoretical Comp. Sci., 56(3):345-353, 1988.
3. [BKN87] D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. J. Symb. Comp., 3:203-216, 1987.
4. [Coo74] S.A. Cook. An observation on time-storage trade off. J. of Comp, and System Sci., 9(3):308-316, 1974.
5. [DG84] W.F. Dowling and J.H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Prog., l(3):267-284, 1984.
6. [DKM84] C. Dwork, P.C. Kanellakis, and J.C. Mitchell. On the sequential nature of unification. J. Logic Prog., 1:35-50, 1984.
7. [GHR95] R. Greenlaw, H.J. Hoover, and W.L. Ruzzo. Limits to parallel computation: P-completeness theory. Oxford University Press, New York, 1995.
8. [GJ79] M.R. Garey and D.S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co, 1979.
9. [HK95a] M. Hermann and P.G. Kolaitis. The complexity of counting problems in equational matching. J. Symb. Comp., 20(3):343-362, 1995.
10. [HK95b] M. Hermann and P.G. Kolaitis. Computational complexity of simultaneous elementary matching problems. In J. Wiedermann and P. Hájek, eds, Proc. 20th MFCS, Prague (Czech Republic), LNCS 969, pp 359-370. Springer, 1995.
11. [JL76] N.D. Jones and W.T. Laaser. Complete problems for deterministic polynomial time. Theoretical Comp. Sci., 3(1):105-117, 1976.
12. [Joh90] D.S. Johnson. A catalog of complexity classes. In J. van Leeuwen, ed, Handbook of Theoretical Computer Science, Volume A, chapter 2, pp 67-161. North-Holland, Amsterdam, 1990.
13. [KN86] D. Kapur and P. Narendran. NP-completeness of the set unification and matching problems. In J.H. Siekmann, ed, Proc. 8th CADE, Oxford (England), LNCS 230, pp 489-495. Springer, 1986.
14. [KN92] D. Kapur and P. Narendran. Complexity of unification problems with associative-commutative operators. J. of Autom. Reasoning, 9:261-288, 1992.
15. [Nar96] P. Narendran. Unification modulo ACI+1+0. Fundamenta Informaticae, 25(l):49-57, 1996.
16. [Pap94] C.H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
17. [Pla84] D.A, Plaisted, Complete problems in the first-order predicate calculus. J. of Comp, and System Sci., 29(l):8-35, 1984.
18. [STZ92] O. Shmueli, S. Tsur, and C. Zaniolo, Compilation of set terms in the logic data language (LDL). J. Logic Prog., 12(1 & 2):89-119, 1992.
19. [Val79a] L.G. Valiant. The complexity of computing the permanent. Theoretical Comp. Sci., 8:189-201, 1979.
20. [Val79b] L.G. Valiant. The complexity of enumeration and reliability problems. SIAM J. on Comp., 8(3):410-421, 1979.