1204 search results - page 39 / 241 » Termination of Polynomial Programs |
JGO
2010
14 years 4 months ago
2010
ICLP
1999
Springer
15 years 2 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
ICLP
1993
Springer
15 years 1 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
193
click to vote
DNA
2011
Springer
13 years 9 months ago
2011
Springer
Sticker complexes are a a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a pure...