17049 search results - page 382 / 3410 » cans 2007 |
162
click to vote
IWINAC
2007
Springer
16 years 1 months ago
2007
Springer
We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequenc...
161
click to vote
SAT
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
170
click to vote
TARK
2007
Springer
16 years 1 months ago
2007
Springer
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and imposs...
146
click to vote
TARK
2007
Springer
16 years 1 months ago
2007
Springer
This paper generalizes the notion of common p-beliefs to situations of ambiguity or Knightian uncertainty. When players have multiple prior beliefs,we show that Aumann’s no-agre...
158
click to vote
WINE
2007
Springer
16 years 29 days ago
2007
Springer
In addition to useful Economic interpretation, auction based algorithms are generally found to be efficient. In this note, we observe that the auction-based mechanism can also be u...