Two-variable logic on data trees and XML reasoning

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 10-19

  Bojańczyk, Mikolaj ^a   David, Claire ^b   Muscholl, Anca ^b   Schwentick, Thomas ^c   Segoufin, Luc ^d  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c TU DORTMUND UNIVERSITY   (Germany)

^d INRIA   (France)

Author keywords

Data trees; Decidability; First order logic

Indexed keywords

ACCESS CONTROL; COMPUTABILITY AND DECIDABILITY; DATA STRUCTURES; PROBLEM SOLVING; XML;

DATA TREES; FIRST-ORDER LOGIC; XML REASONING;

DATABASE SYSTEMS;

EID: 34250617163     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142354     Document Type: Conference Paper

References (23)

1. N. Alon, T. Milo, F. Neven, D. Suciu and V. Vianu. XML with Data Values: Typechecking Revisited In Journal of Computer and System Sciences, 66(4): 688-727 (2003).
2. M. Arenas, W. Fan and L. Libkin. Consistency of XML specifications. In Inconsistency Tolerance, Springer LNCS vol. 3300, 2005, pages 15-41.
3. M. Benedikt, W. Fan, and F. Geerts. XPath Satisfiability in the Presence of DTDs. In PODS'05, 2005.
4. M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on words with data. LIAFA research report, available at http://www.liafa.jussieu.fr/web9/rapportrech/description_fr.php? idrapportrech=678
5. P. Bouyer, A. Petit and D. Thérien. An algebraic approach to data languages and timed languages. Inf. Comput., 182(2): 137-162 (2003).
6. P. Buneman, S. B. Davidson, W. Fan, C. S. Hara, W. C. Tan. Reasoning about keys for XML. In Inf. Syst., 28(8): 1037-1063 (2003).
7. J. Cristau, C. Löding, W. Thomas. Deterministic Automata on Unranked Trees. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT), LNCS (to appear), 2005.
8. C. David. Mots et données infinis. Master's thesis, Université Paris 7, LIAFA, 2004.
9. P. de Groote, B. Guillaume, and S. Salvati. Vector Addition Tree Automata. In LICS'04, pp. 64-73, 2004.
10. S. Demri, R. Lazic, D. Nowak. On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In TIME'05, 2005.
11. K. Etessami, M.Y. Vardi, and Th. Wilke. First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput., 179(2): 279-295 (2002).
12. F. Geerts and W. Fan. Satisfiability of XPath Queries with Sibling Axes. In DBPL'05, 2005.
13. G. Gottlob, C. Koch, and R. Pichler. Efficient Algorithms for Processing XPath Queries. In VLDB, 2002.
14. E. Grädel and M. Otto. On Logics with Two Variables. Theor. Comp. Sci., 224:73-113 (1999).
15. M. Kaminski and N. Francez. Finite memory automata. Theor. Comp. Sci., 134(2):329-363 (1994).
16. E. Kieroński and M. Otto. Small Substructures and Decidability Issues for First-Order Logic with Two Variables. In LICS'05, 2005.
17. W. Martens, J. Niehren. Minimizing Tree Automata for Unranked Trees. In 10th International Symposium on Database Programming Languages, LNCS 3774, 2005.
18. M. Marx. First order paths in ordered trees. In ICDT'05, 2005.
19. M. Mortimer. On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d. Math., 21: 135-140 (1975).
20. F. Neven and T. Schwentick. XPath Containment in the Presence of Disjunction, DTDs, and Variables. In ICDT'03, 2003.
21. K. Neeraj Verma, H. Seidl, T. Schwentick. On the Complexity of Equational Horn Clauses. In CADE'05, 2005.
22. F. Neven, T. Schwentick, and V. Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log., 15(3): 403-435 (2004).
23. XML Path Language (XPath), W3C Recommendation 16 November 1999. Available at http://www.w3.org/TR/xpath.