Sciweavers

14 search results - page 2 / 3
» Explanation-Based Reuse of Prolog Programs
Sort
View
PADL
2004
Springer
13 years 10 months ago
Improved Compilation of Prolog to C Using Moded Types and Determinism Information
We describe the current status of and provide performance results for a prototype compiler of Prolog to C, ciaocc. ciaocc is novel in that it is designed to accept different kinds...
José F. Morales, Manuel Carro, Manuel V. He...
LOPSTR
2009
Springer
13 years 11 months ago
A Transformational Approach for Proving Properties of the CHR Constraint Store
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe
EUROCAST
1994
Springer
139views Hardware» more  EUROCAST 1994»
13 years 9 months ago
Illustrating Constraint Programming Systems in Logistic Planning
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
Jean-Michel Thizy
EUROPAR
2004
Springer
13 years 10 months ago
Concurrent Table Accesses in Parallel Tabled Logic Programs
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
13 years 10 months ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
Ken Taniguchi, Takao Terano