95 search results - page 5 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
MST
2010
13 years 3 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
: The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, ...
EDBT
2006
ACM
14 years 9 months ago
2006
ACM
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
MSCS
2006
13 years 8 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...