Sciweavers

3571 search results - page 268 / 715
» Cohen and Set Theory
Sort
View
203
Voted
POPL
2010
ACM
16 years 4 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
MFCS
2007
Springer
16 years 1 months ago
Traces of Term-Automatic Graphs
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
Antoine Meyer
ECSQARU
2009
Springer
15 years 11 months ago
A Generalization of the Pignistic Transform for Partial Bet
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
Thomas Burger, Alice Caplier
176
Voted
LICS
2010
IEEE
15 years 5 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
APVIS
2011
14 years 7 months ago
Loose capacity-constrained representatives for the qualitative visual analysis in molecular dynamics
Molecular dynamics is a widely used simulation technique to investigate material properties and structural changes under external forces. The availability of more powerful cluster...
Steffen Frey, Thomas Schlömer, Sebastian Grot...