Datalog: A perspective and the potential

tags

Datalog

Notes

why Datalog pops up so often in applications

NOTER_PAGE: (1 . 0.3502454991816694)

proper perspectives on Datalog from the point of view of logic and applications

NOTER_PAGE: (1 . 0.46972176759410805)

compare the expressive power of Datalog with that of more traditional logics

NOTER_PAGE: (1 . 0.6211129296235679)

There is, however, a more traditional logic whose expressive power is ex- actly that of Datalog; it is existential fixed-point logic

NOTER_PAGE: (1 . 0.679214402618658)

use and limitations of Datalog for policy/trust management

NOTER_PAGE: (1 . 0.7585924713584289)

It turns out that standard logic systems (and even many non-logic systems) reduce to Datalog.

NOTER_PAGE: (2 . 0.1849427168576105)

Facts are extensional atomic formulas

NOTER_PAGE: (2 . 0.4468085106382979)

A Datalog query Q is a pair (Π, γ) where Π is a Datalog program and γ an intensional atomic formula

NOTER_PAGE: (2 . 0.6407528641571195)

In fact, Datalog is quite different from first-order logic. Datalog is all about recursion, and first- order logic does not have any recursion

NOTER_PAGE: (5 . 0.6972176759410802)

Liberal Datalog

NOTER_PAGE: (6 . 0.7127659574468086)

We have seen that Datalog has a trivial intersection with first-order logic and constitutes only a sliver of second-order logic.

NOTER_PAGE: (7 . 0.5720130932896891)

Existential fixed-point logic (EFPL) was introduced as the right logic to formulate preconditions and post- conditions of Hoare logic

NOTER_PAGE: (7 . 0.5842880523731587)

It all reduces to Datalog

NOTER_PAGE: (10 . 0.4795417348608838)