We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...