Sciweavers

4128 search results - page 383 / 826
» Learning and using relational theories
Sort
View
ICDT
1997
ACM
74views Database» more  ICDT 1997»
15 years 11 months ago
Serializability of Nested Transactions in Multidatabases
Abstract. The correctness of nested transactions for multidatabases differs from that of at transactions in that, for nested transactions the execution order of siblings at each re...
Ugur Halici, Ismailcem Budak Arpinar, Asuman Dogac
AAAI
1990
15 years 8 months ago
On Acting Together
Joint action by a team does not consist merely of simultaneous and coordinated individual actions; to act together, a team must be aware of and care about the status of the group ...
Hector J. Levesque, Philip R. Cohen, José H...
ACL
1990
15 years 8 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 7 months ago
A General Framework for Sound and Complete Floyd-Hoare Logics
er presents an abstraction of Hoare logic to traced symmetric monoidal categories, a eral framework for the theory of systems. Our abstraction is based on a traced monoidal functor...
Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paul...
ACTA
2006
108views more  ACTA 2006»
15 years 6 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink