Satisfiability of a spatial logic with tree variables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4646 LNCS, Issue , 2007, Pages 130-145

  Filiot, Emmanuel ^a   Talbot, Jean Marc ^b   Tison, Sophie ^a  

^a UNIV LILLE   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; DATA REDUCTION; QUERY PROCESSING; TREES (MATHEMATICS);

INFINITE ALPHABETS; SEMISTRUCTURED DATA; SPATIAL LOGIC; TREE VARIABLES;

FORMAL LOGIC;

EID: 38049035790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_13     Document Type: Conference Paper

References (19)

1. Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-centric general-purpose language. In: 8th ACM International Conf. on Functional Programming, pp. 51-63 (2003)
2. Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) STACS 92. LNCS, vol. 577, pp. 161-171. Springer, Heidelberg (1992)
3. Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and xml reasoning. In: ACM 25th Symp. on Principles of database systems, pp. 10-19(2006)
4. Boneva, I., Talbot, J.M., Tison, S.: Expressiveness of a spatial logic for trees. In: 20th IEEE Symposium on Logic in Computer Science, pp. 280-289 (2005)
5. Briiggemann-KIein, A., Murata, M., Wood, D.: Regular tree languages over non-ranked alphabets, unpublished manuscript (1998)
6. Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 597-610. Springer, Heidelberg (2002)
7. Cardelli, L., Ghelli, G.: TQL: A Query Language for Semistructured Data Based on the Ambient Logic. Mathematical Structures in Computer Science 14, 285-327 (2004)
8. Charatonik, W., Talbot, J.: The Decidability of Model Checking Mobile Ambients. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 339-354. Springer, Heidelberg (2001)
9. Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. TCS 331(1), 143-214 (2005)
10. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications, 1997 (October 1st, 2002)
11. Dauchet, M., Caron, A.-C., Coquidé, J.-L.: Reduction properties and automata with constraints. 20, 215-233 (1995)
12. Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and complexity of graph logic. In: Information and Computation, vol. 205, pp. 263-310 (2007)
13. Hosoya, H., Pierce, B.C.: XDuce: A statically typed xml processing language. ACM Trans. Internet Techn. 3(2), 117-148 (2003)
14. Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Research Report LSV-06-07, LSV, ENS Cachan, France (2006)
15. Karianto, W., Löding, C.: Unranked tree automata with sibling equalities and disequalities. In: 34th International Colloquium on Automata, Languages and Programming (2007)
16. Mongy, J.: Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. PhD thesis, Université de Lille (1981)
17. Murata, M.: Hedge automata: A formal model for xml schemata. Technical report, Fuji Xerox Information Systems (1999)
18. Neven, F., Schwentick, T., Vianu, V.: Towards regular languages over infinite alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 560-572. Springer, Heidelberg (2001)
19. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: 17th IEEE Symp. on Logic in Computer Science, pp. 55-74. IEEE, Los Alamitos (2002)