Sciweavers

287 search results - page 45 / 58
» Data-Driven Constructive Induction
Sort
View
DESRIST
2009
Springer
118views Education» more  DESRIST 2009»
14 years 7 days ago
Building theory in the sciences of the artificial
This essay extends Simon’s arguments in the Sciences of the Artificial to a critical examination of how theorizing in Information Technology disciplines should occur. The essay ...
Shirley Gregor
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 8 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
POPL
2006
ACM
14 years 8 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
ICFP
2006
ACM
14 years 7 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
ICFP
2005
ACM
14 years 7 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell