Sciweavers

3552 search results - page 82 / 711
» Proof theory in the abstract
Sort
View
ML
2000
ACM
15 years 6 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...
EUSFLAT
2009
164views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
60 years "A Mathematical Theory of Communication" - Towards a "Fuzzy Information Theory"
Abstract--When 60 years ago Shannon established "A Mathematical Theory of Communication" nobody could know the consequences for science and technology in the second half ...
Rudolf Seising
JSYML
2008
109views more  JSYML 2008»
15 years 6 months ago
Closed fragments of provability logics of constructive theories
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
Albert Visser
FOSSACS
2011
Springer
14 years 9 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
POPL
2006
ACM
16 years 6 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam