Sciweavers

898 search results - page 43 / 180
» Transitions of the Pre-Symmetry Set
Sort
View
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 1 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
AC
2003
Springer
15 years 3 months ago
Unbounded Petri Net Synthesis
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
Philippe Darondeau
STACS
2001
Springer
15 years 2 months ago
Semantical Principles in the Modal Logic of Coalgebras
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
Dirk Pattinson
IANDC
2000
64views more  IANDC 2000»
14 years 9 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
PUC
2007
96views more  PUC 2007»
14 years 9 months ago
When home base is not a place: parents' use of mobile telephones
Abstract More attention is being paid to the development of information and communication technologies (ICTs) that are sensitive to the needs of people in their homes. By studying ...
Leysia Palen, Amanda L. Hughes