Sciweavers

6960 search results - page 267 / 1392
» Continuity Analysis of Programs
Sort
View
APIN
2010
107views more  APIN 2010»
15 years 4 months ago
Extracting reduced logic programs from artificial neural networks
Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis prob...
Jens Lehmann, Sebastian Bader, Pascal Hitzler
INFORMS
1998
150views more  INFORMS 1998»
15 years 3 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
FASE
2009
Springer
15 years 10 months ago
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover
Abstract. We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate...
Laura Kovács, Andrei Voronkov
144
Voted
LOPSTR
2009
Springer
15 years 10 months ago
The Dependency Triple Framework for Termination of Logic Programs
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
Peter Schneider-Kamp, Jürgen Giesl, Manh Than...
132
Voted
CEC
2005
IEEE
15 years 9 months ago
On improving genetic programming for symbolic regression
This paper reports an improvement to genetic programming (GP) search for the symbolic regression domain, based on an analysis of dissimilarity and mating. GP search is generally di...
Steven Gustafson, Edmund K. Burke, Natalio Krasnog...