Title :
Efficient parallel algorithms for anti-unification and relative complement
Author :
Kuper, G.M. ; McAloon, K.W. ; Palem, K.V. ; Perry, K.J.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
Parallel algorithms and computational complexity results are given for two problems; computing the relative complement of terms and antiunification. The concepts of antiunification and relative complement are useful for theorem proving, logic programming, and machine learning. The relative complement problem is shown to be NP-complete.<>
Keywords :
computational complexity; logic programming; parallel algorithms; theorem proving; NP-complete; antiunification; computational complexity; logic programming; machine learning; parallel algorithms; relative complement; terms; theorem proving; Algorithm design and analysis; Computational complexity; Computational modeling; Concurrent computing; Logic programming; Machine learning; Parallel algorithms; Parallel machines; Phase change random access memory; Polynomials;
Conference_Titel :
Logic in Computer Science, 1988. LICS '88., Proceedings of the Third Annual Symposium on
Conference_Location :
Edinburgh, UK
Print_ISBN :
0-8186-0853-6
DOI :
10.1109/LICS.1988.5109
