Sciweavers

9626 search results - page 433 / 1926
» Invariant Based Programming
Sort
View
PPDP
1999
Springer
15 years 11 months ago
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
Ulrich Neumerkel, Frédéric Mesnard
VL
1998
IEEE
120views Visual Languages» more  VL 1998»
15 years 11 months ago
Visual Patterns + Multi-Focus Fisheye View: An Automatic Scalable Visualization Technique of Data-Flow Visual Program Execution
We present a scalable visualization technique for automatic animation of data-flow visual program execution. We also show a framework to assist programmers' browsing tasks by...
Buntarou Shizuki, Masashi Toyota, Etsuya Shibayama...
CEC
2010
IEEE
15 years 7 months ago
Genetic programming for Expert Systems
— Genetic programming is the usage of the paradigm of survival of the fittest in scientific computing. It is applied to evolve solutions to problems where dependencies between ...
Konrad Sickel, Joachim Hornegger
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
APIN
1998
98views more  APIN 1998»
15 years 6 months ago
The Evolution of Concurrent Programs
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
Brian J. Ross