| D. Diaz, GNU Prolog: A Native Prolog Compiler with Constraint Solving over Finite Domains, The GNU Project, www.gnu.org, 1999. |
....variables and explores value assignments while maintaining consistency between the boolean and the arithmetic constraints. Other researchers have solved the problem by using publicly available logic program solving engines such as the CLP(R) engine [57] used in [10] and the GNUProlog engine [58] used in [11] 3.2 Randomized Techniques Several techniques have been developed which develop test sequences using randomized algorithms to improve overall coverage without a strongly directed search mechanism. An example of such a technique is presented in [59, 9] which uses a genetic algorithm ....
D. Diaz, GNU Prolog: A Native Prolog Compiler with Constraint Solving over Finite Domains, The GNU Project, www.gnu.org, 1999.
No context found.
D. Diaz, GNU Prolog: A Native Prolog Compiler with Constraint Solving over Finite Domains, The GNU Project, www.gnu.org, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC