Sciweavers

321 search results - page 51 / 65
» The Logic of Choice
Sort
View
NDJFL
1998
105views more  NDJFL 1998»
13 years 7 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
BIRTHDAY
2010
Springer
13 years 6 months ago
The Architecture Description Language MoDeL
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
Peter Klein
ICTAI
1997
IEEE
14 years 2 days ago
Toward the Optimization of a Class of Black Box Optimization Algorithms
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
Gang Wang, Erik D. Goodman, William F. Punch III
TYPES
1993
Springer
13 years 12 months ago
The Expressive Power of Structural Operational Semantics with Explicit Assumptions
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...
Marino Miculan
HUC
2010
Springer
13 years 6 months ago
EnergyLife: pervasive energy awareness for households
We present Energy Life a system utilizing wireless sensors, mobile and ambient interfaces that turn energy consumers into active players. Energy Life participants play through dif...
Christoffer Björkskog, Giulio Jacucci, Lucian...