Tree extension algebras: logics, automata, and query languages
Proceedings - Symposium on Logic in Computer Science - Trang 203-212
Tóm tắt
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation T
Từ khóa
#Algebra #Logic functions #Automata #Database languages #XML #Query processing #Logic programming #Computer science #Transducers #VocabularyTài liệu tham khảo
10.1515/9783110806786
10.1145/375551.375554
10.1017/CBO9780511551574
10.1145/275487.275515
10.1007/978-1-4612-0539-5
10.1007/978-3-642-59126-6_7
elgaard, 0, MONA 1.x: New techniques for WS1S and WS2S, CAV'98, 516
thomas, 0, Logical aspects in the study of tree languages, CAAP '84, 31
10.2307/2586806
10.1145/335168.335218
10.3115/981344.981377
bruye?re, 1994, Logic and p-recognizable sets of integers, Bull Belg Math Soc, 1, 191, 10.36045/bbms/1103408547
comon, 0, Tree Automata Techniques and Applications
10.1112/jlms/s2-45.2.377
10.1109/LICS.1996.561360
meyer, 1975, The inherent complexity of theories of ordered sets, Proc Int Congress of Mathematics, 477
mu?ller, 0, Ordering constraints over feature trees expressed in second-order monadic logic, RTAS'98, 196
10.1007/BFb0017447
mu?ller, 0, The first-order theory of ordering constraints over feature trees, LICS'98, 432
10.1007/BFb0028571
10.1007/BFb0017466
10.1007/3-540-57163-9_34
smolka, 1995, The Oz programming model, Computer Science Today, 324, 10.1007/BFb0015252
aiken, 0, Set constraints: Results, applications, and future directions, PPCP'94, 326
abiteboul, 1995, Foundations of Databases
10.1109/LICS.2000.855755
10.1109/LICS.2001.932513
10.1016/0743-1066(94)90044-2
10.1137/S0097539798342484
10.1145/347476.347477
10.1145/503272.503292
anthony, 1992, Computational Learning Theory
10.1006/inco.1999.2792
10.1007/BF01744439
benedikt, 0, A model-theoretic approach to regular string relations, LICS'01, 431
10.1145/375551.375578