In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
A genetic algorithm scheme with a stochastic genotype/phenotype relation is proposed. The mechanisms responsible for this intermediate level of uncertainty, are inspired by the bio...
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...