IMHO that paper is overcomplicated. They claim they propose some unifying generalization of state space search techniques novel by the time, but it seems that got no traction and that the paper is not highly cited and the term is not widely used. Though that paper and the concept was recommended by authors of the book on AI (Russel & Norvig) in the paragraph devoted to state space search, so I suspect the concept may have some value.
Could anyone explain the paper without formalism of languages, parsing, computability theory and so on, just the similar way it is described in the book (graphs of nodes, sets, frontier, FIFO, LIFO, costs, heuristics, etc)? I mean I'm not currently interested in computability theory and any other highly theoretical stuff, I deal with practical problems and I find the formalism related to language parsing, finite automata, computability theory, terminals, non-terminals, LL, LR, GLR, etc highly irrelevant here. I guess I'm not alone in that feeling, and I guess that was the reason these papers never got enough traction — just too little people understood what the authors tried to say.