367 search results - page 43 / 74 » A Rewriting Logic Sampler |
ACMICEC
2005
ACM
14 years 1 months ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
TLCA
2001
Springer
14 years 10 days ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
POPL
2000
ACM
14 years 8 days ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
AML
2005
13 years 7 months ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
ICCAD
2007
IEEE
14 years 4 months ago
2007
IEEE
While circuit density and power efficiency increase with each major advance in IC technology, reliability with respect to soft errors tends to decrease. Current solutions to this...