564 search results - page 29 / 113 » Some Results on the Expressive Power and Complexity of LSCs |
VTC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
160
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
AIML
2006
14 years 11 months ago
2006
We observe that the known fact that the difference logic and the hybrid logic with universal modality have the same expressive power on Kripke frames can be strengthened for a far ...
ACTA
1998
14 years 9 months ago
1998
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...