3571 search results - page 134 / 715 » Cohen and Set Theory |
330
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
168
Voted
COCO
2007
Springer
16 years 1 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
172
click to vote
ECSCW
2003
15 years 8 months ago
2003
The constructs of "common ground" and "grounding" are frequently invoked in the CSCW literature as a mechanism by which participants engaged in joint activity c...
216
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The probabilistic formalism of quantum physics is said to provide a sound basis for building a principled information retrieval framework. Such a framework can be based on the not...
195
Voted
WRLA
2010
15 years 5 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...