We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
Daniel de Carvalho, Michele Pagani, Lorenzo Tortor...
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
The development of techniques for knowledge-based navigation constitutes one of the major trends in the current research on mobile robotics. Fuzzy logic provides tools that are of...
Hrudaya K. Tripathy, B. K. Tripathy, Pradip K. Das
Comprehenders often need to go beyond conventional word senses to obtain an appropriate interpretation of an expression. We report an experiment examining the processing of standa...
Brian McElree, Steven Frisson, Martin J. Pickering
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...