Sciweavers

29 search results - page 2 / 6
» Tree Extension Algebras: Logics, Automata, and Query Languag...
Sort
View
RTA
2000
Springer
13 years 8 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
ADBIS
2005
Springer
124views Database» more  ADBIS 2005»
13 years 10 months ago
On Modal Deductive Databases
We present a query language called MDatalog, which is an extension of Datalog for multimodal deductive databases. We define modal relational algebras and give the seminaive evalua...
Linh Anh Nguyen
POPL
2004
ACM
14 years 5 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
SIGMOD
2008
ACM
143views Database» more  SIGMOD 2008»
14 years 5 months ago
XML query optimization in the presence of side effects
The emergence of database languages with side effects, notably for XML, raises significant challenges for database compilers and optimizers. In this paper, we extend an algebra fo...
Giorgio Ghelli, Nicola Onose, Kristoffer Hø...
AMAST
2010
Springer
12 years 12 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte