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

62 pointsby simonpurevor 6 Jahren5 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

chakerbvor 6 Jahren

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.

tejtmvor 6 Jahren

needs 1989 in the title

nlvor 6 Jahren

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

JoelMcCrackenvor 6 Jahren

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

NovemberWhiskeyvor 6 Jahren

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