2062 search results - page 331 / 413 » Derivatives of Logical Formulas |
127
click to vote
APAL
2007
15 years 5 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
144
click to vote
ENTCS
2008
15 years 5 months ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
140
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
This paper describes a method for risk analysis based on the approach used in CRAMM, but instead of using discrete measures for threats and vulnerabilities and lookup tables to de...
166
click to vote
CORR
2009
Springer
15 years 3 months ago
2009
Springer
on of abstract strategies which is extensional in the sense that a strategy is defined explicitly of derivations of an abstract reduction system. We then move to a more intensional...
156
click to vote
FSS
2010
15 years 3 months ago
2010
In this paper, we introduce a linearity test for fuzzy rule-based models in the framework of time series modeling. To do so, we explore a family of statistical models, the regime ...