Sciweavers

3044 search results - page 10 / 609
» Linear logical approximations
Sort
View
GCC
2003
Springer
14 years 21 days ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
FOSSACS
2004
Springer
14 years 26 days ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
SCL
2008
109views more  SCL 2008»
13 years 7 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
TCS
2011
13 years 2 months ago
Musings around the geometry of interaction, and coherence
We introduce the Danos-Régnier category
Jean Goubault-Larrecq
LICS
1991
IEEE
13 years 11 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller