499 search results - page 30 / 100 » Constructive Induction by Analogy |
ENTCS
2006
13 years 7 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of nite structures if every (FO + LFP) formula is equivalent to a rst-order formula in K. H...
DIAGRAMS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Euler diagrams are an effective and intuitive way of representing relationships between sets. As the number of sets represented grows, Euler diagrams can become `cluttere...
PTS
2010
13 years 6 months ago
2010
This paper addresses the challenge of generating test sets that achieve functional coverage, in the absence of a complete specification. The inductive testing technique works by p...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...