Efficient parallel term matching and anti-unification (Q688582): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: PARLOG: parallel programming in logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the complexity of exploiting data dependency in parallel logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sequential nature of unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Term Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing connected components on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for forest and term matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the parallel complexity of anti-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most specific logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for the connected components and minimal spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term matching on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00245298 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1492604685 / rank
 
Normal rank

Latest revision as of 09:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient parallel term matching and anti-unification
scientific article

    Statements

    Efficient parallel term matching and anti-unification (English)
    0 references
    0 references
    0 references
    22 March 1994
    0 references
    EREW PRAM
    0 references
    CRCW PRAM
    0 references
    term matching
    0 references
    anti-unification
    0 references
    logic programming
    0 references
    symbolic pattern matching
    0 references
    inductive inference
    0 references
    theorem proving
    0 references

    Identifiers