1187 search results - page 25 / 238 » Computation in Extended Argumentation Frameworks |
ICLP
1990
Springer
14 years 15 days ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
COMMA
2008
13 years 10 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
COMMA
2010
13 years 3 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...
DSN
2005
IEEE
14 years 2 months ago
2005
IEEE
Hardware dependability improvements have led to a situation in which it is sometimes unnecessary to employ extensive hardware replication to mask hardware faults. Expanding upon o...
ENTCS
2008
13 years 8 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...