Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Abstract Families of Abstract Categorial Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Alternating two-way AC-tree automata
Information and Computation
Static analysis of XML processing with data values
ACM SIGMOD Record
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
On two extensions of abstract categorial grammars
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
The reachability problem for branching vector addition systems requires doubly-exponential space
Information Processing Letters
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Rewriting systems for reachability in vector addition systems with pairs
RP'10 Proceedings of the 4th international conference on Reachability problems
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
Minimalist grammars in the light of logic
Logic and grammar
Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The complexity and generative capacity of lexicalized abstract categorial grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
On the Complexity of Linear Authorization Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences
Nondeterministic Phase Semantics and the Undecidability of Boolean BI
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We introduce a new class of automata, which we call vector addition tree automata. These automata are a natural generalization of vector addition systems with states, which are themselves equivalent to Petri nets. Then, we prove that the decidability of provability inmultiplicative exponential linear logic (which is an open problem)is equivalent to the decidability of the reachability relation for vector addition tree automata. This result generalizes the well-known connection existingbetween Petri nets and the !-Horn fragment of multiplicative exponential linear logic.