GC
2011
Springer
13 years 7 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
GC
2011
Springer
13 years 7 months ago
2011
Springer
GC
2011
Springer
13 years 7 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
GC
2011
Springer
13 years 7 months ago
2011
Springer
COMSIS
2010
13 years 7 months ago
2010
COMMA
2010
13 years 7 months ago
2010
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
COMMA
2010
13 years 7 months ago
2010
Recently Argumentation Mechanism Design (ArgMD) was introduced as a paradigm for studying argumentation using game-theoretic techniques. To date, this framework has been used to st...
COMMA
2010
13 years 7 months ago
2010
In order to support the interchange of ideas and data between different projects and applications in the area of computational argumentation, a common ontology for computational ar...
COMMA
2010
13 years 7 months ago
2010
Abstract. This paper presents a technique with which instances of argument structures in the Carneades model can be given a probabilistic semantics by translating them into Bayesia...
COMMA
2010
13 years 7 months ago
2010
Abstract. This paper combines two recent extensions of Dung's abstract argumenrameworks in order to define an abstract formalism for reasoning about preferences in structured ...