Sciweavers

4666 search results - page 112 / 934
» Equations on Timed Languages
Sort
View
110
Voted
ACL
2009
14 years 10 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
98
Voted
ICALP
2007
Springer
15 years 7 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
ICDT
2007
ACM
114views Database» more  ICDT 2007»
15 years 7 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
84
Voted
ICALP
2004
Springer
15 years 6 months ago
Extensional Theories and Rewriting
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
Grigore Rosu
119
Voted
ICALP
2003
Springer
15 years 6 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli