Sciweavers

1094 search results - page 83 / 219
» On Computing Explanations in Argumentation
Sort
View
RELMICS
1997
Springer
15 years 4 months ago
Relational Matching for Graphical Calculi of Relations
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
Wolfram Kahl
100
Voted
CIE
2006
Springer
15 years 4 months ago
Inverting Monotone Continuous Functions in Constructive Analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
97
Voted
BIRTHDAY
2008
Springer
15 years 2 months ago
The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant....
Wolfgang Reisig
CHI
2008
ACM
16 years 1 months ago
PeerChooser: visual interactive recommendation
Collaborative filtering (CF) has been successfully deployed over the years to compute predictions on items based on a user's correlation with a set of peers. The black-box na...
Barry Smyth, Brynjar Gretarsson, John O'Donovan, S...
AI
2008
Springer
15 years 24 days ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini