Sciweavers

780 search results - page 92 / 156
» Reasoning about sets using redescription mining
Sort
View
TSE
2010
151views more  TSE 2010»
14 years 11 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
ICTAI
2007
IEEE
15 years 7 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
COR
2008
131views more  COR 2008»
15 years 8 days ago
Comparing methods for multiattribute decision making with ordinal weights
This paper is concerned with procedures for ranking discrete alternatives when their values are evaluated precisely on multiple attributes and the attribute weights are known only...
Byeong Seok Ahn, Kyung Sam Park
110
Voted
ICFP
2005
ACM
16 years 19 days ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida
96
Voted
ICCS
2005
Springer
15 years 6 months ago
Merge-Based Computation of Minimal Generators
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
Céline Frambourg, Petko Valtchev, Robert Go...