Sciweavers

1711 search results - page 8 / 343
» Completing pseudojump operators
Sort
View
LORI
2009
Springer
14 years 2 months ago
A General Family of Preferential Belief Removal Operators
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...
Richard Booth, Thomas Meyer, Chattrakul Sombatthee...
BTW
2007
Springer
93views Database» more  BTW 2007»
14 years 1 months ago
Towards an Integrated Model for Data, Metadata, and Operations
: 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...
Jürgen Göres, Stefan Dessloch
ECAL
2007
Springer
14 years 1 months ago
Turing Complete Catalytic Particle Computers
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...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
CORR
2008
Springer
62views Education» more  CORR 2008»
13 years 7 months ago
A complete study of electroactive polymers for energy scavenging: modelling and experiments
Recent progresses in ultra low power microelectronics propelled the development of several microsensors and particularly the self powered microsystems (SPMS). One of their limitat...
C. Jean-Mistral, S. Basrour, J. J. Chaillout, A. B...
JAPLL
2010
131views more  JAPLL 2010»
13 years 6 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
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...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...