Logical Foundations of XML and XQuery

XML is the underlying representation formalism of much web-data. Thus to reason about web-data essentially boils down to reasoning about data in XML format. In this course the students learn about the main languages for querying XML data: XPath and XQuery. The course contains both theoretical work and practical examples.

[1]  Georg Gottlob,et al.  Conjunctive queries over trees , 2004, JACM.

[2]  Maarten Marx,et al.  Navigational XPath: calculus and algebra , 2007, SGMD.

[3]  Wenfei Fan,et al.  Rewriting Regular XPath Queries on XML Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[4]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

[5]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[6]  Kousha Etessami,et al.  First-order logic with two variables and unary temporal logic , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[7]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[8]  Georg Gottlob,et al.  Efficient Algorithms for Processing XPath Queries , 2002, VLDB.

[9]  Gabriel M. Kuper,et al.  Structural Properties of XPath Fragments , 2003, ICDT.

[10]  Kousha Etessami,et al.  Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997 , 1997, LICS.

[11]  Maarten A. Hajer,et al.  Setting the Stage , 2005, Strategy and Command.

[12]  Joost Engelfriet,et al.  Nested Pebbles and Transitive Closure , 2006, STACS.

[13]  Maarten Marx,et al.  Exemelification of parliamentary debates , 2009 .

[14]  Börkur Sigurbjörnsson,et al.  Focused information access using XML element retrieval , 2006 .

[15]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[16]  Erhard Rahm,et al.  Data Cleaning: Problems and Current Approaches , 2000, IEEE Data Eng. Bull..

[17]  Derick Wood,et al.  Caterpillars, context, tree automata and tree pattern matching , 2000, Developments in Language Theory.

[18]  Nicole Schweikardt,et al.  The succinctness of first-order logic on linear orders , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[19]  Connolly,et al.  Database Systems , 2004 .

[20]  Thomas Schwentick,et al.  XPath Containment in the Presence of Disjunction, DTDs, and Variables , 2003, ICDT.

[21]  E. Goris,et al.  Looping caterpillars [semistructured data querying] , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[22]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[23]  Loredana Afanasiev,et al.  XCheck: a platform for benchmarking XQuery engines , 2006, VLDB.

[24]  C. Lutz.  The Complexity of Reasoning with Concrete Domains , 1999 .

[25]  M. de Rijke,et al.  Articulating information needs in XML query languages , 2006, TOIS.

[26]  Joann J. Ordille,et al.  Querying Heterogeneous Information Sources Using Source Descriptions , 1996, VLDB.

[27]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[28]  Frank Neven,et al.  Learning deterministic regular expressions for the inference of schemas from XML data , 2008, WWW.

[29]  Johan Van Benthem.  Program Constructions that are Safe for Bisimulation , 1998 .

[30]  Rens Vliegenthart,et al.  Divergent framing: The public debate on migration in the Dutch parliament and media, 1995–2004 , 2007 .

[31]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[32]  G. N. Gilbert.  Computational Social Science , 2010 .

[33]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[34]  Maarten Marx,et al.  Axiomatizing the Logical Core of XPath 2.0 , 2008, Theory of Computing Systems.

[35]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

[36]  J W Ballard,et al.  Data on the web? , 1995, Science.

[37]  Stéphane Bressan,et al.  Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web , 2003, Lecture Notes in Computer Science.

[38]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[39]  Joachim Niehren,et al.  Polynomial time fragments of XPath with variables , 2007, PODS.

[40]  Balder ten Cate,et al.  The expressivity of XPath with transitive closure , 2006, PODS.

[41]  C. C. van Baalen,et al.  In vergadering bijeen. Rituelen, symbolen, tradities en gebruiken in de Tweede Kamer , 2008 .

[42]  Maarten Marx,et al.  Conditional XPath , 2005, TODS.

[43]  Jan Chomicki,et al.  Hippo: A System for Computing Consistent Answers to a Class of SQL Queries , 2004, EDBT.

[44]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[45]  Janet Seaton,et al.  The Scottish Parliament and e-democracy , 2005, Aslib Proc..

[46]  Wenfei Fan,et al.  SMOQE: a system for providing secure access to XML , 2006, VLDB.

[47]  M. de Rijke,et al.  Semantic characterizations of navigational XPath , 2005, SGMD.

[48]  Neil Immerman,et al.  On the Unusual Effectiveness of Logic in Computer Science , 2001, Bulletin of Symbolic Logic.

[49]  Joann J. Ordille,et al.  Data integration: the teenage years , 2006, VLDB.

[50]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[51]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[52]  Martin Lange,et al.  Model checking propositional dynamic logic with all extras , 2006, J. Appl. Log..

[53]  Jignesh M. Patel,et al.  The Michigan Benchmark: A Microbenchmark for XML Query Processing Systems , 2002, EEXTT.

[54]  Ian M. Hodkinson,et al.  Separation - Past, Present, and Future , 2005, We Will Show Them!.

[55]  Martin Reynaert,et al.  Non-interactive OCR Post-correction for Giga-Scale Digitization Projects , 2008, CICLing.

[56]  Robert Hariman,et al.  Political Style: The Artistry of Power , 1995 .

[57]  Stephan Merz,et al.  Model Checking , 2000 .

[58]  Marco Hollenberg.  An Equational Axiomatization of Dynamic Negation and Relational Composition , 1997, J. Log. Lang. Inf..

[59]  Carsten Lutz,et al.  The complexity of query containment in expressive fragments of XPath 2.0 , 2007, PODS.

[60]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[61]  Maarten Marx,et al.  XPath with Conditional Axis Relations , 2004, EDBT.

[62]  Andrew Trotman,et al.  The Simplest Query Language That Could Possibly Work , 2004 .

[63]  Helmut Seidl,et al.  Exact XML Type Checking in Polynomial Time , 2007, ICDT.

[64]  Krisztian Balog,et al.  People search in the enterprise , 2007, SIGF.

[65]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[66]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.