Sciweavers

257 search results - page 42 / 52
» The Connectionist Inductive Learning and Logic Programming S...
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
14 years 9 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 3 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
CSL
2007
Springer
15 years 3 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
64
Voted
ICML
1989
IEEE
15 years 1 months ago
Uncertainty Based Selection of Learning Experiences
The training experiences needed by a learning system may be selected by either an external agent or the system itself. We show that knowledge of the current state of the learner&#...
Paul D. Scott, Shaul Markovitch
ALT
1994
Springer
15 years 1 months ago
Explanation-Based Reuse of Prolog Programs
This paper presents a method of extracting subprograms from background knowledge. Most studies on learning logic programs so far developed are mainly concerned with pure Prolog, so...
Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa