Sciweavers

52 search results - page 10 / 11
» Propositional Games with Explicit Strategies
Sort
View
ATAL
2005
Springer
15 years 10 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
COGSCI
2004
53views more  COGSCI 2004»
15 years 4 months ago
On the spontaneous discovery of a mathematical relation during problem solving
People spontaneously discover new representations during problem solving. Discovery of a mathematical representation is of special interest, because it shows that the underlying s...
James A. Dixon, Ashley S. Bangert
CORR
2010
Springer
194views Education» more  CORR 2010»
15 years 1 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
SELMAS
2004
Springer
15 years 9 months ago
A Software Framework for Automated Negotiation
If agents are to negotiate automatically with one another they must share a negotiation mechanism, specifying what possible actions each party can take at any given time, when nego...
Claudio Bartolini, Chris Preist, Nicholas R. Jenni...
CSFW
2003
IEEE
15 years 9 months ago
A Procedure for Verifying Security Against Type Confusion Attacks
A type confusion attack is one in which a principal accepts data of one type as data of another. Although it has been shown by Heather et al. that there are simple formatting conv...
Catherine Meadows