Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
A detailed connectionist architecture is described which is capable of relating psychological behavior to the functioning of neurons and neurochemicals. The need to be able to bui...
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...