• Oz

  • Referenced in 113 articles [sw06799]
  • constraint store. It supports finite domain and feature constraints and has powerful primitives for programming...
  • Prolog

  • Referenced in 68 articles [sw06518]
  • free Prolog compiler with constraint solving over finite domains developed by Daniel Diaz. GNU Prolog ... Prolog also includes an efficient constraint solver over Finite Domains (FD). This opens contraint logic ... user combining the power of constraint programming to the declarativity of logic programming...
  • B-Prolog

  • Referenced in 17 articles [sw06949]
  • clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative...
  • BEE

  • Referenced in 8 articles [sw16989]
  • Compiling finite domain constraints to SAT with BEE. We present BEE, a compiler which enables ... encode finite domain constraint problems to CNF. Using BEE both eases the encoding process ... user and also performs transformations to simplify constraints and optimize their encoding to CNF. These ... often highly beneficial when solving hard finite domain constraint problems. ABEE implementation is available with...
  • Zinc

  • Referenced in 25 articles [sw08334]
  • automatic coercion and provides arithmetic, finite domain and set constraints. Second, while Zinc...
  • PROTOS-L

  • Referenced in 7 articles [sw02876]
  • access to external relational databases, and finite domain constraints. The type concept covers user defined ... OSF/Motif, and also with the finite domain constraint solver...
  • cc(FD)

  • Referenced in 17 articles [sw21237]
  • declarative nondeterministic constraint logic language over finite domains based on the cc framework...
  • GASP

  • Referenced in 11 articles [sw07096]
  • been realized using Constraint Logic Programming over finite domains...
  • clpfd

  • Referenced in 8 articles [sw06308]
  • present a new constraint solver over finite domains, freely available as library(clpfd ... domain-specific language that concisely expresses the full semantics of constraint reification. The library...
  • DesertFD

  • Referenced in 2 articles [sw06586]
  • DesertFD: a finite-domain constraint based tool for design space exploration As the complexity ... decisions at design time. DesertFD is a domain-independent design space exploration tool which facilitates ... pruning of a design space using constraint satisfaction. DesertFD offers a formal tree-based view ... into a constraint satisfaction problem using finite domain constraints. We examine two example design space...
  • Figaro

  • Referenced in 2 articles [sw00289]
  • Existing libraries and languages for finite domain constraint programming usually have depth-first search (with...
  • pl-nauty

  • Referenced in 1 article [sw22940]
  • commonly used in logic programming and constraint solving, with the ability to reduce symmetries while ... chains, such as SAT-solvers or finite domain constraints compilers which exist for Prolog...
  • URSA

  • Referenced in 4 articles [sw15541]
  • semantics of the specification language. The domain of the approach is wide (e.g., many ... solved by using other programming languages or constraint programming systems. So, the system ... general-purpose constraint solving system (for finite domains). In this paper, we also describe...
  • FaCiLe

  • Referenced in 3 articles [sw31028]
  • constraint programming library on integer and integer set finite domains written in OCaml. It offers ... create and manipulate finite domain variables, arithmetic expressions and constraints (possibly non-linear), built...
  • ntccSim

  • Referenced in 1 article [sw33009]
  • same model. For instance, constraints over finite domains (FD) and real intervals (XRI) have been...
  • constraint

  • Referenced in 1 article [sw23098]
  • module offers solvers for Constraint Solving Problems (CSPs) over finite domains in simple and pure ... variables (a, b, ...), domains (a in [1, 2, 3], ...), and constraints...
  • BOXES

  • Referenced in 6 articles [sw21178]
  • Intervals) domain with finite disjunctions. An element of Boxes is a finite union of boxes ... propositional formula over upper- and lower-bounds constraints. Our implementation is symbolic, and weds...
  • CaSPER

  • Referenced in 6 articles [sw08629]
  • Powerful interface for adding new constraints due to efficient domain delta information availability (information about ... variable’s domains). Powerful interface for adding new reasoning domains. Constructs for modeling search available ... Builtin modules for finite domain variables, finite set domain variables, graph domain variables, generic (possibly...
  • RAHFT

  • Referenced in 2 articles [sw24485]
  • domain, a tool for manipulating finite tree automata and various solvers for reasoning about constraints...
  • LAF-SPEM

  • Referenced in 7 articles [sw09702]
  • method based on an unconditionally stable time domain numerical scheme, oriented to electromagnetic transient simulations ... approached by using the alternating directions implicit finite difference scheme, in a leapfrog ... order to efficiently overcome the stability relation constraint of explicit schemes. In fact...