4099 search results - page 379 / 820 » A Framework for Interactive Proof |
156
click to vote
ICWS
2004
IEEE
15 years 8 months ago
2004
IEEE
In this paper we make a contribution to the proof and trust layer of the Semantic Web layer cake by integrating two well founded techniques, namely DAML-S (for describing Web serv...
157
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
156
click to vote
IJCAI
2003
15 years 8 months ago
2003
A default conditional α → β has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional. That is, the intui...
197
Voted
DAGSTUHL
1996
15 years 8 months ago
1996
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
169
click to vote
EJC
2010
15 years 6 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...