Sciweavers

451 search results - page 4 / 91
» Relationless Completeness and Separations
Sort
View
ICNC
2005
Springer
14 years 3 days ago
On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem,and the solution can be reduced to determining the minimal co...
Renren Liu, Zhiwei Gong, Fen Xu
FSTTCS
2004
Springer
13 years 12 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ICALP
2007
Springer
14 years 22 days ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
ACS
2010
13 years 6 months ago
Lawvere Completion and Separation Via Closure
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
Dirk Hofmann, Walter Tholen
PERCOM
2003
ACM
14 years 6 months ago
A Pervasive Keyboard - Separating Input from Display
A novel text input for public displays and palmtop computers is presented that separates the input from the display of the edited text. While the public display shows both the edi...
Carsten Magerkurth, Richard Stenzel