47 search results - page 4 / 10 » Proof nets for display logic |
FLAIRS
2001
14 years 11 months ago
2001
This paper presents a methodand implementation resuits for the transformation of WordNetglosses into logic forms. Theglosses, currently expressed in English are a rich source of w...
CSL
2004
Springer
15 years 3 months ago
2004
Springer
CSR
2008
Springer
14 years 12 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
RP
2009
Springer
15 years 4 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...