2303 search results - page 169 / 461 » On the logic of argumentation theory |
138
click to vote
SIAMCO
2008
15 years 6 months ago
2008
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
172
click to vote
ENTCS
2008
15 years 6 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...
217
click to vote
MST
2011
15 years 1 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
157
click to vote
JIIS
2006
15 years 6 months ago
2006
It is well-known that knowledgebases may contain inconsistencies. We provide a measure to quantify the inconsistency of a knowledgebase, thereby allowing for the comparison of the...
160
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...