A.9 library(clpfd): CLP(FD): Constraint Logic Programming over Finite Domains
AllApplicationManualNameSummaryHelp

  • Documentation
    • Reference manual
      • The SWI-Prolog library
        • library(clpfd): CLP(FD): Constraint Logic Programming over Finite Domains
          • Introduction
          • Arithmetic constraints
          • Declarative integer arithmetic
          • Example: Factorial relation
          • Combinatorial constraints
          • Domains
          • Example: Sudoku
          • Residual goals
          • Core relations and search
          • Example: Eight queens puzzle
          • Optimisation
          • Reification
          • Enabling monotonic CLP(FD)
          • Custom constraints
          • Applications
          • Acknowledgments
          • CLP(FD) predicate index
          • Closing and opening words about CLP(FD)
    • Packages

A.9.15 Applications

CLP(FD) applications that we find particularly impressive and worth studying include:

  • Michael Hendricks uses CLP(FD) constraints for flexible reasoning about dates and times in the julian package.
  • Julien Cumin uses CLP(FD) constraints for integer arithmetic in Brachylog.