1743 search results - page 187 / 349 » Generalized Modal Satisfiability |
180
click to vote
EUROCRYPT
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a defi...
159
click to vote
ECML
1993
Springer
15 years 10 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
163
click to vote
EUROGP
2000
Springer
15 years 10 months ago
2000
Springer
A mathematical formula containing one or more free variables is "general" in the sense that it provides a solution to an entire category of problems. For example, the fa...
150
click to vote
ISCC
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
141
click to vote
AAAI
2008
15 years 8 months ago
2008
Horn-to-Horn belief revision asks for the revision of a Horn knowledge base such that the revised knowledge base is also Horn. Horn knowledge bases are important whenever one is c...