ABSTRACT
We consider a sequence t1,...,tk of XML documents that is produced by a sequence of local edit operations. To describe properties of such a sequence, we use a temporal logic. The logic can navigate both in time and in the document, e.g. a formula can say that every node with label a eventually gets a descendant with label b. For every fixed formula, we provide an evaluation algorithm that works in time O(k ⋅ log(n)), where k is the number of edit operations and n is the maximal size of document that is produced. In the algorithm, we represent formulas of the logic by a kind of automaton, which works on sequences of documents. The algorithm works on XML documents of bounded depth.
- Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, and Mayank Saksena. Regular model checking for LTL(MSO). In CAV, volume 3114 of Lecture Notes in Computer Science, pages 348--360. Springer, 2004.Google Scholar
- Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena. A survey of regular model checking. In CONCUR, volume 3170 of Lecture Notes in Computer Science, pages 35--48. Springer, 2004.Google Scholar
- Serge Abiteboul, Laurent Herr, and Jan Van den Bussche. Temporal connectives versus explicit timestamps to query temporal databases. J. Comput. Syst. Sci., 58(1):54--68, 1999. Google Scholar
Digital Library
- Andrey Balmin, Yannis Papakonstantinou, and Victor Vianu. Incremental validation of XML documents. ACM Trans. Database Syst., 29(4):710--751, 2004. Google Scholar
Digital Library
- Denilson Barbosa, Alberto O. Mendelzon, Leonid Libkin, Laurent Mignet, and Marcelo Arenas. Efficient incremental validation of XML documents. In ICDE, pages 671--682, 2004. Google Scholar
Digital Library
- Henrik Bjorklund, Wouter Gelade, Marcel Marquardt, and Wim Martens. Incremental XPath evaluation. In ICDT, pages 162--173, 2009. Google Scholar
Digital Library
- M. Bojanczyk and I. Walukiewicz. Forest algebras. In Automata and Logic: History and Perspectives, pages 107--132. Amsterdam University Press, 2007.Google Scholar
- Miko laj Bojanczyk and Pawel Parys. XPath evaluation in linear time. In PODS, pages 241--250, 2008. Google Scholar
Digital Library
- Ghislain Fourny, Daniela Florescu, Donald Kossmann, and Markos Zacharioudakis. A time machine for XML: PUL composition. In XML Prague, 2010.Google Scholar
- David Gabelaia, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. Products of 'transitive' modal logics. J. Symb. Log., 70(3):993--1021, 2005.Google Scholar
Cross Ref
- Leonid Libkin. Logics for unranked trees: An overview. Logical Methods in Computer Science, 2(3), 2006.Google Scholar
- Bernd-Holger Schlingloff. Expressive completeness of temporal logic of trees. Journal of Applied Non-Classical Logics, 2(2), 1992.Google Scholar
Cross Ref
- Luc Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL, pages 41--57, 2006. Google Scholar
Digital Library
Index Terms
Efficient evaluation for a temporal logic on changing XML documents
Recommendations
Querying xml documents in logic programming*
Extensible Markup Language (XML) is a simple, very flexible text format derived from SGML. Originally designed to meet the challenges of large-scale electronic publishing, XML is also playing an increasingly important role in the exchange of a wide ...
On temporal logic versus datalog
Logic and complexity in computer scienceWe provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...
A Complete Axiomatization of Propositional Projection Temporal Logic
TASE '08: Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software EngineeringThis paper investigates a complete axiomatic system for Propositional Projection Temporal Logic (PPTL). To this end, the syntax, semantics, and logic laws of PPTL are briefly introduced. Further, the normal form of PPTL formulas is presented. Moreover, ...






Comments