3831 search results - page 361 / 767 » Dynamic Context Logic |
176
click to vote
IPL
2002
15 years 6 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
184
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
165
click to vote
SLOGICA
2010
15 years 5 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
196
click to vote
FORMATS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
182
click to vote
ICTIR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A mismatch between differenteventspaceshasbeen used toargue against rank equivalence of classic probabilistic models of information retrieval and language models. We ques...