Sciweavers

555 search results - page 17 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
PODS
1991
ACM
93views Database» more  PODS 1991»
13 years 11 months ago
The Expressiveness of a Family of Finite Set Languages
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
Neil Immerman, Sushant Patnaik, David W. Stemple
COORDINATION
2004
Springer
14 years 27 days ago
Optimistic Concurrency Semantics for Transactions in Coordination Languages
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
Suresh Jagannathan, Jan Vitek
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 2 months ago
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann,...
ENTCS
2010
133views more  ENTCS 2010»
13 years 7 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
LICS
1989
IEEE
13 years 11 months ago
Elf: A Language for Logic Definition and Verified Metaprogramming
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
Frank Pfenning