111 search results - page 20 / 23 » Definability in Logic and Rough Set Theory |
POPL
2009
ACM
14 years 9 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
CISSE
2008
Springer
13 years 10 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
ICFP
2006
ACM
14 years 8 months ago
2006
ACM
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
JAIR
2008
13 years 8 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...