896 search results - page 48 / 180 » On completeness of word reversing |
102
Voted
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
88
Voted
IPL
2007
15 years 18 days ago
2007
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
94
Voted
ORL
2008
14 years 11 months ago
2008
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
105
click to vote
JUCS
2010
14 years 11 months ago
2010
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
84
Voted
FLAIRS
2009
14 years 10 months ago
2009
Providing the first few letters of a missing word in a sentence gives information about this word. This paper attempts to measure the information transmitted in that case. In orde...