Datalog over trees strikes back

Prelegent(ci)

Adam Witkowski

Afiliacja

Uniwersytet Warszawski

Termin

10 grudnia 2014 14:15

Pokój

p. 5870

Seminarium

Seminarium „Teoria automatów”

---

I will present the proof of decidability of containment of monadic, connected, linear Datalog programs over trees with infinite alphabet.

---