2517 search results - page 121 / 504 » Specifying Weak Sets |
170
click to vote
SIGECOM
2008
ACM
15 years 5 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
171
click to vote
SPIESR
1998
15 years 6 months ago
1998
Abstract. Imaging applications such as filtering, image transforms and compression/decompression require vast amounts of computing power when applied to large data sets. These appl...
165
click to vote
ASE
2002
15 years 5 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
144
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
142
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...