2152 search results - page 157 / 431 » On Automating the Calculus of Relations |
164
click to vote
JETC
2008
15 years 5 months ago
2008
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
164
click to vote
RR
2009
Springer
16 years 29 days ago
2009
Springer
In this paper we present an embedding of propositional production systems into µ-calculus, and first-order production systems into fixed-point logic, with the aim of using these...
167
click to vote
LICS
2008
IEEE
16 years 25 days ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
185
click to vote
LICS
2008
IEEE
16 years 25 days ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
141
click to vote
LICS
2007
IEEE
16 years 21 days ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...