News for hackers. Stuff that matters.
Re:What You Always Wanted to Know About Datalog (2018) [pdf] by chakerb on Friday October 09, 2020 @05:08AM (#24728121)
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.

Re:What You Always Wanted to Know About Datalog (2018) [pdf] by tejtm on Thursday October 08, 2020 @07:40PM (#24725147)
needs 1989 in the title
Re:What You Always Wanted to Know About Datalog (2018) [pdf] by nl on Thursday October 08, 2020 @08:20PM (#24725433)
Oddly at the moment the title includes "(2018)"!
Re:What You Always Wanted to Know About Datalog (2018) [pdf] by JoelMcCracken on Thursday October 08, 2020 @09:51PM (#24725929)
Yeah, I was like “wait I read that paper way before 2018, what gives??”
Re:What You Always Wanted to Know About Datalog (2018) [pdf] by NovemberWhiskey on Friday October 09, 2020 @08:33AM (#24729232)
Of continuing relevance: the Rego language that's used in Open Policy Agent (OPA) is an extension of Datalog.