4352 search results - page 148 / 871 » A Representation Theorem and Applications |
157
click to vote
KR
1998
Springer
15 years 10 months ago
1998
Springer
This work is motivated by the existence of two useful but quite different knowledge representation formalisms, the situation calculus due to McCarthy, and the logic OL of only kno...
148
click to vote
ITP
2010
15 years 10 months ago
2010
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
134
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose a novel representation for collective beliefs that uses modular, tran...
148
click to vote
APAL
2010
15 years 6 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
178
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Takens' Embedding Theorem remarkably established that concatenating M previous outputs of a dynamical system into a vector (called a delay coordinate map) can be a one-to-one...