ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

On the Relationship of Congruence Closure and Unification.

Paris C. Kanellakis, Peter Z. Revesz: On the Relationship of Congruence Closure and Unification. DBPL 1987: 23-41
@inproceedings{DBLP:conf/dbpl/KanellakisR87,
  author    = {Paris C. Kanellakis and
               Peter Z. Revesz},
  editor    = {Fran\c{c}ois Bancilhon and
               Peter Buneman},
  title     = {On the Relationship of Congruence Closure and Unification},
  booktitle = {Advances in Database Programming Languages, Papers from DBPL-1,
               September 1987, Roscoff, France},
  publisher = {ACM Press / Addison-Wesley},
  year      = {1987},
  isbn      = {0-201-50257-7},
  pages     = {23-41},
  ee        = {db/conf/dbpl/KanellakisR87.html},
  crossref  = {DBLP:conf/dbpl/87},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 5, SSDBM, DBPL, KRDB, ADBIS, COOPIS, SIGBDP" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

References

[1]
Ivan E. Auger, Mukkai S. Krishnamoorthy: A Parallel Algorithm for the Monadic Unification Problem. BIT 25(2): 302-306(1985) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
Peter J. Downey, Ravi Sethi: Assignment Commands with Array References. J. ACM 25(4): 652-666(1978) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
Peter J. Downey, Ravi Sethi, Robert Endre Tarjan: Variations on the Common Subexpression Problem. J. ACM 27(4): 758-771(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
Cynthia Dwork, Paris C. Kanellakis, John C. Mitchell: On the Sequential Nature of Unification. J. Log. Program. 1(1): 35-50(1984) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer: Parallel Algorithms for Term Matching. SIAM J. Comput. 17(4): 711-731(1988) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
Steven Fortune, James Wyllie: Parallelism in Random Access Machines. STOC 1978: 114-118 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[7]
...
[8]
...
[9]
...
[10]
Dexter Kozen: Complexity of Finitely Presented Algebras. STOC 1977: 164-177 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
...
[12]
John W. Lloyd: Foundations of Logic Programming, 1st Edition. Springer 1984, ISBN 3-540-13299-6
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[13]
Alberto Martelli, Ugo Montanari: An Efficient Unification Algorithm. ACM Trans. Program. Lang. Syst. 4(2): 258-282(1982) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
Greg Nelson, Derek C. Oppen: Fast Decision Procedures Based on Congruence Closure. J. ACM 27(2): 356-364(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[15]
Derek C. Oppen: Reasoning About Recursively Defined Data Structures. J. ACM 27(3): 403-411(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
Mike Paterson, Mark N. Wegman: Linear Unification. J. Comput. Syst. Sci. 16(2): 158-167(1978) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[17]
Nicholas Pippenger: On Simultaneous Resource Bounds (Preliminary Version). FOCS 1979: 307-311 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[18]
R. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan: Term Matching on Parallel Computers. ICALP 1987: 336-346 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[19]
John Alan Robinson: A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12(1): 23-41(1965) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[20]
...
[21]
Walter L. Ruzzo: Tree-Size Bounded Alternation. J. Comput. Syst. Sci. 21(2): 218-235(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[22]
Robert Endre Tarjan: Efficiency of a Good But Not Linear Set Union Algorithm. J. ACM 22(2): 215-225(1975) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[23]
James W. Thatcher, Jesse B. Wright: Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic. Mathematical Systems Theory 2(1): 57-81(1968) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[24]
Jeffrey Scott Vitter, Roger A. Simons: New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P. IEEE Trans. Computers 35(5): 403-418(1986) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[25]
Hiroto Yasuura: On Parallel Computational Complexity of Unification. FGCS 1984: 235-243 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Fri Mar 12 17:09:25 2010 by Michael Ley (ley@uni-trier.de)