Paper: Efficient parallel algorithms for anti-unification and relative complement (at LICS 1988)

Authors: Gabriel M. Kuper Ken McAloon Krishna V. Palem Kenneth J. Perry

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

BibTeX

  @InProceedings{KuperMcAloonPalemPe-Efficientparallelal,
    author = 	 {Gabriel M. Kuper and Ken McAloon and Krishna V. Palem and Kenneth J. Perry},
    title = 	 {Efficient parallel algorithms for anti-unification and relative complement },
    booktitle =  {Proceedings of the Third Annual IEEE Symposium on Logic in Computer Science (LICS 1988)},
    year =	 {1988},
    month =	 {July}, 
    pages =      {112--120},
    location =   {Edinburgh, Scotland, UK}, 
    publisher =	 {IEEE Computer Society Press}
  }