10304 search results - page 2020 / 2061 » Computer science with the sciences: an emphasis in computati... |
CTRS
1990
15 years 1 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
MFPS
1989
15 years 1 months ago
1989
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order ...
PODS
1989
ACM
15 years 1 months ago
1989
ACM
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...
WDAG
1989
Springer
15 years 1 months ago
1989
Springer
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
WDAG
1990
Springer
15 years 1 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...