1795 search results - page 164 / 359 » On the Complexity of Circuit Satisfiability |
CORR
2004
Springer
13 years 8 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...
INLG
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we propose a general way of constructing an NLG system that permits the systematic exploration of the effects of particular system choices on output quality. We cal...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
ISSRE
2010
IEEE
13 years 7 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
DLT
2009
13 years 6 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...