Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
The diversity of negotiation types in e-commerce calls for a clear description of the rules that govern them. The participant has to know the rules before engaging in a negotiation...
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in Gen...
In gb, the importance of phrase-structure rules has dwindled in favour of nearness conditions. Today, nearness conditions play a major role in defining the correct linguistic rep...