Datalog over trees strikes back

Speaker(s)

Adam Witkowski

Affiliation

Uniwersytet Warszawski

Date

Dec. 10, 2014, 2:15 p.m.

Room

room 5870

Seminar

Seminar Automata Theory

---

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

---