Sciweavers

1288 search results - page 41 / 258
» Visual Generalization in Programming by Example
Sort
View
ETAI
2000
84views more  ETAI 2000»
14 years 11 months ago
Learning Stochastic Logic Programs
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
Stephen Muggleton
RTSS
2006
IEEE
15 years 5 months ago
Programming Execution-Time Servers in Ada 2005
Much of the research on scheduling schemes is prevented from being used in practice by the lack of implementations vide the necessary abstractions. An example of this lack of prov...
Alan Burns, Andy J. Wellings
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 4 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 3 months ago
Automatic Synthesis of Electrical Circuits Containing a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
John R. Koza, Martin A. Keane, Jessen Yu, William ...
JELIA
2010
Springer
14 years 10 months ago
Parametrized Logic Programming
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
Ricardo Gonçalves, José Júlio...