The reminds me of how powerful the expressiveness of Datalog is. You can even syntactically check whether the program can run in p-time or not. Once you introduce negation in the recursion it starts to be a little bit complicated, though.
Also the fact that the language it self is declarative it's inherently more parallelizable than imperative languages.
needs 1989 in the title
Oddly at the moment the title includes "(2018)"!
Yeah, I was like “wait I read that paper way before 2018, what gives??”
Of continuing relevance: the Rego language that's used in Open Policy Agent (OPA) is an extension of Datalog.