106 search results - page 1 / 22 » Light Logics and Optimal Reduction: Completeness and Complex... |
63
Voted
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
AAAI
2007
15 years 15 days ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
107
click to vote
JAR
2007
14 years 10 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
96
Voted
CORR
2004
Springer
14 years 10 months ago
2004
Springer
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...