On the sequential nature of unification
DOI10.1016/0743-1066(84)90022-0zbMATH Open0588.68045OpenAlexW1982801224MaRDI QIDQ3716320FDOQ3716320
Authors: Cynthia Dwork, Paris C. Kanellakis, John Mitchell 
Publication date: 1984
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(84)90022-0
Recommendations
parallel algorithmPRAMresolution theorem provingterm matchingrepresentation of terms by directed acyclic graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (43)
- Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
- C-expressions: A variable-free calculus for equational logic programming
- Title not available (Why is that?)
- Average-case analysis of unification algorithms
- Another variation on the common subexpression problem
- A note on the parallel complexity of anti-unification
- Efficient parallel term matching and anti-unification
- Efficient tree pattern unification
- Title not available (Why is that?)
- The complexity of the satisfiability problem for Krom formulas
- On determining the causes of nonunifiability
- On the relationship of congruence closure and unification
- Unifications, deunifications, and their complexity
- Optimal parallel algorithms for forest and term matching
- The complexity of type inference for higher-order typed lambda calculi
- An analysis of the Core-ML language: Expressive power and type reconstruction
- Type inference with simple subtypes
- Associative-commutative unification
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient labelled nested multiset unification algorithm
- Title not available (Why is that?)
- Exploiting parallelism in coalgebraic logic programming
- Title not available (Why is that?)
- A practically efficient and almost linear unification algorithm
- A theory of strict P-completeness
- A theory of strict P-completeness
- Fine-grained concurrent completion
- Automata-driven efficient subterm unification
- Classifying the computational complexity of problems
- Term matching on parallel computers
- Tight complexity bounds for term matching problems
- Rational unification in 28 characters
- On the logic of unification
- New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
- Title not available (Why is that?)
- Some complexity bounds for subtype inequalities
- Set-term unification in a logic database language
- Automatic theorem proving. II
- Title not available (Why is that?)
- A parallel algorithm for the monadic unification problem
- Unary resolution: characterizing \textsc{Ptime}
- Unique normal forms for nonlinear term rewriting systems: Root overlaps
This page was built for publication: On the sequential nature of unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716320)
