535 search results - page 28 / 107 » Do we need dependent types |
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one corre...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
The term web genre denotes the type of a given web resource, in contrast to the topic of its content. In this research, we focus on recognizing the web genres blog, wiki and forum...
AAIM
2008
Springer
13 years 9 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
ICWSM
2009
13 years 5 months ago
2009
In spite of enormous previous efforts to model the growth of various networks, there have only been a few works that successfully describe the evolution of latent networks. In a l...