On the sequential nature of unification
Journal of Logic Programming
Properties of substitutions and unifications
Journal of Symbolic Computation
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
Parallel algorithms for term matching
Proc. of the 8th international conference on Automated deduction
On parallel unification for Prolog
New Generation Computing
On the relationship of congruence closureand unification
Journal of Symbolic Computation
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Handbook of theoretical computer science (vol. A)
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
An introduction to parallel algorithms
An introduction to parallel algorithms
Suprema of open and closed formulas and their application to resolution
Information and Computation
Finding connected components in O(log n log log n) time on the EREW PRAM
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Journal of Symbolic Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Solving Combinatorial Problems with Regular Local Search Algorithms
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Journal of Functional Programming
Abducing priorities to derive intended conclusions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Knowledge modeling and reusability in ExClaim
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Hi-index | 0.00 |
MGU_{mon} and MGU_{k-rep} have a complementary role in unification in the complexity class NC. MGU_mon is the upper bound of the unification classes that fall in NC and whose inputs admit an unrestricted number of repeated variables. MGU_{k-rep} is the upper bound of the unification classes that still fall in NC but whose inputs admit an unrestricted arity on term constructors. No LogSpace reduction of the one to the other class is known. Moreover, very fast algorithms that solve the two separately are well known but no one is able to compute with both in polylog PRAM-Time. N-axioms unification extends the structure of unification inputs and brings out the notion of interleaving variable as a special repeated variable which serializes independet computations. Based on it, we define the unification class AMGU^k_{p/h} whose inputs have a fixed number of interleaving variables but admit unrestricted number of repeated variables and, at the same time, unrestricted arity for term constructors. Constructively, we prove that AMGU^k_{p/h} is in NC by introducing a new unification algorithm that works on graph contractions and solves AMGU^k_{p/h} in a polylog PRAM time of the input size. Finally, we prove that MGU_{mon}, MGU_{k-rep} , and MGU_{linear} all are LogSpace reducible to AMGU^k_{p/h}. Hence, AMGU^k_{p/h} becomes the upper bound of the unification classes that are proved to be in NC.