The Query Language TQL Dipartimento di Informaticathe查询语言tql 计算机科学系.pptVIP

Spatial tree logics to reason about Semistructured Data Speaker: Giovanni Conforti Joint work with: Giorgio Ghelli What I’m going to talk about … A gentle introduction to Spatial Tree Logics (STL) STL and Semistructured Data (SSD) Properties of SSD (Constraints, Types, Queries) ? Spatial Tree Logic (STL) Formulas Decision Problems for SSD ? Validity/Satisfiability of STL Formulas Presentation of a decidable fragment of the TQL logic Background: Spatial Logics Modal Logics to describe properties of structured worlds Many Applications: Ambient Calculus, ?-calculus, tree structured data, shared data structures, … Spatial (and temporal) modal operators to describe structure (and behavior) Equivalence, model checking and validity problem are already studied for many spatial logics Many works involving Cardelli, Gordon, Caires, Ghelli, Gardner, … A Simple Ground Spatial Tree Logic Worlds = Information trees : Unordered (multisets of) labeled trees F,F’ ::= 0 (empty root) | n[F] (an edge labelled n leading to the i.t. F) | F | F (the i.t. F “next to” the i.t F’) Logic = propositional logic connectives + modal operators describing the structure A,B :: = True | Not A | A and B 0 | n[A] | A | B Examples F = book[ title[Databases[0]] | author[Ghelli[0]] | author[Albano[0]] ] First order and modal recursion The full TQL logic extends the ground fragment with: X tree variables x[A] locations with label variables Exists x. A quantification over labels (and trees) μξ. A fixpoint (ξ positive in A) Decision Problems Given a formula A and a model F Model checking: F |= A ? Query Answering: find values of x such that F |= A(x) Satisfiability sat(A): Exists a F’ such that F’ |= A ? Validity vld(A): is true that For each model F’, F’ |= A ? Negation in the logic: Sat(A) ?? Not vld(Not A) Implication?F. F|=A implies F|=B ?? vld(Not A Or B) With the simple ground STL