Sciweavers

903 search results - page 13 / 181
» Completeness Results for Memory Logics
Sort
View
APAL
2005
89views more  APAL 2005»
13 years 7 months ago
Softness of hypercoherences and MALL full completeness
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
Richard Blute, Masahiro Hamano, Philip J. Scott
DAS
2004
Springer
14 years 26 days ago
A Complete Approach to the Conversion of Typewritten Historical Documents for Digital Archives
This paper presents a complete system that historians/archivists can use to digitize whole collections of documents relating to personal information. The system integrates tools an...
Apostolos Antonacopoulos, Dimosthenis Karatzas
ISQED
2007
IEEE
136views Hardware» more  ISQED 2007»
14 years 1 months ago
Strain Silicon Optimization for Memory and Logic in Nano-Scale CMOS
Straining of silicon improves mobility of carriers resulting in speed enhancement for transistors in CMOS technology. Traditionally, silicon straining is applied in a similar ad-h...
Rajani Kuchipudi, Hamid Mahmoodi
SAS
1991
Springer
102views Formal Methods» more  SAS 1991»
13 years 11 months ago
Equational Logics
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
Yong Sun
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 8 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt