325 search results - page 25 / 65 » Proofs of Restricted Shuffles |
118
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
122
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
175
click to vote
PODC
1990
ACM
15 years 8 months ago
1990
ACM
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
138
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
111
click to vote
FOSSACS
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...