709 search results - page 24 / 142 » In-stroke word completion |
JAR
2007
14 years 11 months ago
2007
We present a variant of the basic ordered superposition rules to handle equality in an analytic free-variable tableau calculus. We prove completeness of this calculus by an adaptat...
IPL
2008
14 years 11 months ago
2008
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...
101
click to vote
TSD
2007
Springer
15 years 6 months ago
2007
Springer
Our research is about an adaptive keyboard, which autonomously adjusts its predictive features and key displays to current user input. We used personalized word prediction to impro...
CADE
2008
Springer
16 years 3 days 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...
IPL
2007
14 years 11 months 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] ...