Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
Harish Devarajan, Dominic J. D. Hughes, Gordon D. ...
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
Essential elements of aspect-oriented programming can be formulated as forms of logic programming. Extensions of Horn Clause rovide richer abstraction and control mechanisms. Defi...
Abstract-- Recently, many scholars investigated interval, triangular, and trapezoidal approximations of fuzzy numbers. These researches can be grouped into two classes: the Euclide...