Data structures and algorithms for disjoint set union problems

Z Galil, GF Italiano - ACM Computing Surveys (CSUR), 1991 - dl.acm.org
The set union problem has been widely studied during the past decades. The problem
consists of maintaining a collection of disjoint sets under the operation of union. More …

Unification: A multidisciplinary survey

K Knight - ACM Computing Surveys (CSUR), 1989 - dl.acm.org
The unification problem and several variants are presented. Various algorithms and data
structures are discussed. Research on unification arising in several areas of computer …

Dynamo: Amazon's highly available key-value store

G DeCandia, D Hastorun, M Jampani… - ACM SIGOPS operating …, 2007 - dl.acm.org
Reliability at massive scale is one of the biggest challenges we face at Amazon. com, one of
the largest e-commerce operations in the world; even the slightest outage has significant …

[SÁCH][B] Artificial intelligence: a new synthesis

NJ Nilsson - 1998 - books.google.com
Intelligent agents are employed as the central characters in this introductory text. Beginning
with elementary reactive agents, Nilsson gradually increases their cognitive horsepower to …

[SÁCH][B] The handbook of artificial intelligence

A Barr, EA Feigenbaum, PR Cohen - 1981 - books.google.com
The handbook of artificial intelligence Page 1 COVERS O FLAPS The Handbook OfArtificial
Intelligence VOLUME 3 Page 2 PROPERTY OF NIU CEET LIBRARY Northern Illinois …

Negation as failure

KL Clark - Logic and data bases, 1977 - Springer
A query evaluation process for a logic data base comprising a set of clauses is described. It
is essentially a Horn clause theorem prover augmented with a special inference rule for …

Generative communication in Linda

D Gelernter - ACM Transactions on Programming Languages and …, 1985 - dl.acm.org
Generative communication is the basis of a new distributed programming langauge that is
intended for systems programming in distributed settings generally and on integrated …

Algorithm= logic+ control

R Kowalski - Communications of the ACM, 1979 - dl.acm.org
The notion that computation= controlled deduction was first proposed by Pay Hayes [19] and
more recently by Bibel [2] and Vaughn-Pratt [31]. A similar thesis that database systems …

An efficient unification algorithm

A Martelli, U Montanari - ACM Transactions on Programming Languages …, 1982 - dl.acm.org
The unification problem in f'mst-order predicate calculus is described in general terms as the
solution of a system of equations, and a nondeterministic algorithm is given. A new …

Text, discourse and process

R De Beaugrande - Norwood, NJ: Ablex, 1980 - degruyter.com
Showing how language theories must be operationally conceived and empirically validated
with studies of routine human activities in communication, this volume uses real texts …