1187 search results - page 26 / 238 » Computation in Extended Argumentation Frameworks |
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
NMR
2004
Springer
14 years 1 months ago
2004
Springer
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...
AUTOMATICA
2007
13 years 8 months ago
2007
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
AAAI
2007
13 years 10 months ago
2007
The goal of my research is to understand speech input in a continuous manner by treating the input stream as fragmental utterances. This allows us to use various approaches to pre...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...