What You Always Wanted to Know About Datalog (2018) [pdf](personal.utdallas.edu)

62 pointsby simonpure6 anni fa5 comments

personal.utdallas.edu

What You Always Wanted to Know About Datalog (2018) [pdf]

https://personal.utdallas.edu/~gupta/courses/acl/papers/datalog-paper.pdf

5 comments

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.

tejtm6 anni fa

needs 1989 in the title

nl6 anni fa

Oddly at the moment the title includes "(2018)"!

JoelMcCracken6 anni fa

Yeah, I was like “wait I read that paper way before 2018, what gives??”

NovemberWhiskey6 anni fa

Of continuing relevance: the Rego language that's used in Open Policy Agent (OPA) is an extension of Datalog.