Publication | Closed Access
Efficient parallel algorithms for anti-unification and relative complement
12
Citations
5
References
2003
Year
Unknown Venue
Theory Of ComputingRelative ComplementComputational Complexity ResultsEngineeringAutomated ReasoningComplementarity ProblemsParallel Complexity TheoryRelative Complement ProblemFormal MethodsComputational ComplexityParallel ProgrammingComputer ScienceComputational ProblemEquivalence CheckingParallel ComputingP Versus Np ProblemUnification GrammarFormal Verification
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1