1711 search results - page 8 / 343 » Completing pseudojump operators |
143
click to vote
LORI
2009
Springer
15 years 11 months ago
2009
Springer
Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for the...
115
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: Information integration requires manipulating data and metadata in ways that in general go beyond a single existing transformation formalism. As a result, a complete source-to-ta...
144
click to vote
ECAL
2007
Springer
15 years 10 months ago
2007
Springer
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Recent progresses in ultra low power microelectronics propelled the development of several microsensors and particularly the self powered microsystems (SPMS). One of their limitat...
141
click to vote
JAPLL
2010
15 years 2 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...