Ascend FD-23R Bedienungsanleitung Seite 14

  • Herunterladen
  • Zu meinen Handbüchern hinzufügen
  • Drucken
  • Seite
    / 81
  • Inhaltsverzeichnis
  • LESEZEICHEN
  • Bewertet. / 5. Basierend auf Kundenbewertungen
Seitenansicht 13
2 CHAPTER 1. The TOY(FD) System
In TOY(FD), finite domain (FD) constraints are integrated as functions to make
them first-class citizens, which means that they can be used in any place where a data
can (e.g., as arguments of functions). This provides a powerful mechanism to define
higher order constraints.
One important characteristic of TOY(FD) is that it enables to solve all the
CLP(FD) applications as well as another problems closer to the functional setting.
In summary, TOY(FD) has important benefits as it takes functions, higher order
patterns, partial applications, non-determinism, lazy evaluation, logical variables, and
types from the FLP paradigm and domain variables, constraints, and propagators
from the FD constraint community. This leads to a more declarative way of expressing
problems which cannot be reached from FP or LP alone.
1.2 The Current Implementation
1.2.1 Where to Find TOY(FD)?
TOY(FD) version 0.8 is freely available as a compressed file toyfd.zip at
http://www.lcc.uma.es/afdez/cflpfd
1.2.2 Requirements
TOY(FD) is implemented on top of SICStus Prolog and requires SICStus 3#8.2 (or
probably higher although this was not tested yet). The current version has been tested
under Windows 2000 and is also valid for Unix systems.
Note: The current version has been successfully tested on a PC with Windows
2000 and using SICStus 3.8.2.
1.2.3 Efficiency
In Fern´andez et al., 2003a we showed that TOY(FD) is fairly efficient as, in general,
behaves closely to SICStus. Despite this is not surprisingly as it is implemented on
top of SICStus, we think that it is important to show that the wrapping of SICStus by
TOY does not increase significantly the computation time.
Moreover, in the same paper we showed that TOY(FD) is about two and
five times faster (and even much more in scalable problems) than another
CFLP(FD) implementation M. Hanus (editor), 2002 to come which is said to be ef-
ficient in its Web page (http://redstar.cs.pdx.edu/pakcs/).
1.2.4 Referencing this Software
When referring to this implementation of TOY(FD), please use the reference Fern´andez
et al., 2003a.
Seitenansicht 13
1 2 ... 9 10 11 12 13 14 15 16 17 18 19 ... 80 81

Kommentare zu diesen Handbüchern

Keine Kommentare