A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Computer systems increasingly carry out tasks in mixed networks, that is in group settings in which they interact both with other computer systems and with people. Participants in...
Ya'akov Gal, Barbara J. Grosz, Sarit Kraus, Avi Pf...
Chia-Jung Chan This paper presents a development of our comic generation system that automatically summarizes players' actions and interactions in the virtual world. The featu...
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...