ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
On the relationship of congruence closure
Source Acm Press Frontier Series archive
Advances in database programming languages book contents
Pages: 23 - 41  
Year of Publication: 1990
ISBN:0-201-50257-7
Authors
Paris C. Kanellakis
Peter Z. Revesz
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/101620.101622
What is a DOI?

CITED BY
Jan Chomicki , Tomasz Imieliński, Finite representation of infinite query answers, ACM Transactions on Database Systems (TODS), v.18 n.2, p.181-223, June 1993

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.0 General
          Subjects: Parallel algorithms


General Terms:
Algorithms, Theory

Collaborative Colleagues:
Paris C. Kanellakis: colleagues
Peter Z. Revesz: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player