1204 search results - page 97 / 241 » Termination of Polynomial Programs |
EPIA
2005
Springer
15 years 6 months ago
2005
Springer
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
135
Voted
MACH
1993
15 years 2 months ago
1993
This paper describes the architecture and implementation of MIKE - a version of the IK distributed persistent object-oriented programming platform built on top of the Mach microke...
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...
107
click to vote
IEEEPACT
2002
IEEE
15 years 5 months ago
2002
IEEE
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...
103
click to vote
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...