Tabu search is a “higher level” heuristic procedure for solving optimization problems,
designed to guide other methods (or their component processes) to escape the trap of local …

ABSTRACT College of Business, CB 419 University of Colorado Boulder, CO 80309 email:
Fred. Glover@ colorado. edu Tabu search (TS) has provided advances for solving difficult …

This paper presents a complete theory of credal networks, structures that associate convex
sets of probability measures with directed acyclic graphs. Credal networks are graphical …

Ontologies play a crucial role in the development of the Semantic Web as a means for
defining shared terms in web resources. They are formulated in web ontology languages …

Genetic algorithms and tabu search have a number of significant differences. They also
have some common bonds, often unrecognized. We explore the nature of the connections …

We review three leading stochastic optimization methods—simulated annealing, genetic
algorithms, and tabu search. In each case we analyze the method, give the exact algorithm …

The work in this paper is directed towards sophisticated formalisms for reasoning under
probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role in …

Bounds on system probability in terms of marginal or joint component probabilities are of
interest when exact solutions cannot be obtained. Currently, bounding formulas employing …

Abstract argumentation offers an appealing way of representing and evaluating arguments
and counterarguments. This approach can be enhanced by considering probability …

This book is the first to combine coverage of fuzzy logic and Semantic Web languages. It
provides in-depth insight into fuzzy Semantic Web languages for non-fuzzy set theory and …