Sciweavers

3053 search results - page 152 / 611
» A Logic of Abstract Argumentation
Sort
View
APAL
2008
104views more  APAL 2008»
15 years 6 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
KER
2006
158views more  KER 2006»
15 years 6 months ago
Formal systems for persuasion dialogue
This article reviews formal systems that regulate persuasion dialogues. In such dialogues two or more participants aim to resolve a difference of opinion, each trying to persuade ...
Henry Prakken
TPHOL
2005
IEEE
16 years 4 days ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts
DIGRA
2003
Springer
15 years 11 months ago
Exploration in computer games - a new starting point
Space, vast lands and dungeons… It is no coincidence that Space War and Adventure are among the best known of the first computer games. Both clearly appeal to the player’s cur...
Simon Egenfeldt-Nielsen
NDJFL
2010
15 years 1 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen