Sciweavers

13383 search results - page 2567 / 2677
» Abstractions from proofs
Sort
View
PODS
1989
ACM
129views Database» more  PODS 1989»
15 years 10 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
POPL
1989
ACM
15 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
SIGOPSE
1990
ACM
15 years 10 months ago
A replicated Unix file system
u s e s t h e p r i m a r y c o p y r e p l i c a t i o nAbstract technique [1, 26, 27]. In this method, client calls are directed to a single primary server, which communicatesThi...
Barbara Liskov, Robert Gruber, Paul Johnson, Liuba...
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 10 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
DEXA
1998
Springer
179views Database» more  DEXA 1998»
15 years 10 months ago
Concurrent Warehouse Maintenance Without Compromising Session Consistency
Abstract. To achieve acceptable query response times in data warehouse environments, the data have to be pre-aggregated according to the need of the applications and stored redunda...
Michael Teschke, Achim Ulbrich
« Prev « First page 2567 / 2677 Last » Next »