Sciweavers

500 search results - page 37 / 100
» On the Hardness of Being Truthful
Sort
View
FORTE
1994
15 years 1 months ago
An improvement in formal verification
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
Gerard J. Holzmann, Doron Peled
CCR
2006
135views more  CCR 2006»
14 years 12 months ago
You must be joking...: should the internet have an ON/OFF switch?
If despite your better judgment you decide to read this article, keep in mind that it was written during the summer, and this has been the hottest summer ever. To avoid such artic...
Michalis Faloutsos
EXPERT
2006
156views more  EXPERT 2006»
14 years 12 months ago
Computational Models of Ethical Reasoning: Challenges, Initial Steps, and Future Directions
on abstract principles that you can't easily apply in a formal, deductive fashion. So, the favorite tools of logicians and mathematicians, such as firstorder logic, aren'...
Bruce M. McLaren
JSYML
2010
107views more  JSYML 2010»
14 years 10 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 6 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...