Sciweavers

792 search results - page 48 / 159
» Value Based Argumentation Frameworks
Sort
View
SFP
2001
13 years 11 months ago
Function Types in Complete Type Inference
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
Manfred Widera, Christoph Beierle
LWA
2008
13 years 11 months ago
Weighted Voting as Approximate MAP Prediction in Pairwise Classification
Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows excellent performance in practice, it is often criticized ...
Eyke Hüllermeier, Stijn Vanderlooy
TCS
2008
13 years 9 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
LOGCOM
1998
132views more  LOGCOM 1998»
13 years 9 months ago
Agents That Reason and Negotiate by Arguing
The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a...
Simon Parsons, Carles Sierra, Nicholas R. Jennings
ICFP
2007
ACM
14 years 9 months ago
Tangible functional programming
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...
Conal Elliott