We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
In order to increase the role of machines in supporting more capabilities as regards a spoken dialogue system, we present in this paper a new problem incorporating multi-session in...
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models sema...
Abstract. The success of a case-based reasoning system depends critically on the relevance of the case base. Much current CBR research focuses on how to compact and refine the con...