Sciweavers

4397 search results - page 703 / 880
» Relational Algebra Operations
Sort
View
LPNMR
1993
Springer
15 years 7 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
STACS
1994
Springer
15 years 7 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
LCPC
1992
Springer
15 years 7 months ago
A Calculus of Gamma Programs
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...
Chris Hankin, Daniel Le Métayer, David Sand...
RTSS
1992
IEEE
15 years 7 months ago
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
Kevin Jeffay
PODS
1990
ACM
150views Database» more  PODS 1990»
15 years 7 months ago
On Being Optimistic about Real-Time Constraints
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
Jayant R. Haritsa, Michael J. Carey, Miron Livny