Sciweavers

1549 search results - page 296 / 310
» On the rules of intermediate logics
Sort
View
234
Voted
POPL
2003
ACM
16 years 2 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
107
Voted
POPL
2010
ACM
15 years 11 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
127
Voted
SAC
2010
ACM
15 years 8 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
ACSAC
2009
IEEE
15 years 8 months ago
An Empirical Approach to Modeling Uncertainty in Intrusion Analysis
: © An Empirical Approach to Modeling Uncertainty in Intrusion Analysis Xinming Ou, Siva Raj Rajagopalan, Sakthiyuvaraja Sakthivelmurugan HP Laboratories HPL-2009-334 intrusion de...
Xinming Ou, Siva Raj Rajagopalan, Sakthiyuvaraja S...
AMR
2007
Springer
167views Multimedia» more  AMR 2007»
15 years 8 months ago
Ontology: Use and Abuse
This paper is a critical analysis of the use of ontology as an instrument to specify the semantics of a document. The paper argue that not only is a logic of the type used in ontol...
Simone Santini