Sciweavers

2944 search results - page 189 / 589
» On Well Quasi-orders on Languages
Sort
View
SIGMOD
2003
ACM
106views Database» more  SIGMOD 2003»
16 years 7 months ago
XPath Processing in a Nutshell
We provide a concise yet complete formal definition of the semantics of XPath 1 and summarize efficient algorithms for processing queries in this language. Our presentation is int...
Georg Gottlob, Christoph Koch, Reinhard Pichler
CP
2005
Springer
16 years 22 days ago
Graph Invariants as Necessary Conditions for Global Constraints
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram...
ICALP
2004
Springer
16 years 18 days 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
MFCS
2004
Springer
16 years 17 days ago
Decidability of Trajectory-Based Equations
We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the o...
Michael Domaratzki, Kai Salomaa
UML
2004
Springer
16 years 16 days ago
SVERTS - Specification and Validation of Real-Time and Embedded Systems
: This paper presents an overview on the workshop on Specification and Validation of Real-time and embedded Systems that has taken place for the second time in association with the...
Susanne Graf, Øystein Haugen, Ileana Ober, ...