1080 search results - page 43 / 216 » The Complexity of Belief Update |
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
151
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
183
click to vote
TARK
2009
Springer
16 years 22 days ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
314
click to vote
STOC
2012
ACM
13 years 8 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
162
click to vote
ER
2007
Springer
16 years 11 days ago
2007
Springer
To be a full-featured data exchange format, XML should support not only queries but also updates on its contents. The new W3C XML update facility has proposed a set of operators (...