• CPLEX

  • Referenced in 2538 articles [sw04082]
  • related problems. Specifically, it solves linearly or quadratically constrained optimization problems where the objective ... variables in the model may be declared as continuous or further constrained to take only...
  • D-FLAT

  • Referenced in 7 articles [sw09895]
  • FLAT: Declarative problem solving using tree decompositions and answer-set programming. In this work ... decomposition and (ii) provide an interface for declarative specifications of dynamic programming algorithms. In this ... based D-FLAT encodings for some problems outperform monolithic ASP encodings on instances of small...
  • teaspoon

  • Referenced in 3 articles [sw27500]
  • teaspoon : Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming. Answer ... Programming (ASP) is an approach to declarative problem solving, combining a rich yet simple modeling...
  • G12

  • Referenced in 11 articles [sw10112]
  • software platform for solving large scale industrial combinatorial optimisation problems. The core design involves three ... declarative modelling language for expressing problems, independent of any solving methodology. Cadmium is a mapping...
  • SALSA

  • Referenced in 30 articles [sw02661]
  • efficient technique for solving hard combinatorial optimization problems. However, it is best used in conjunction ... elegant description and retaining the original declarativity of Constraint Logic Programming. We propose a language...
  • IDP3

  • Referenced in 7 articles [sw22941]
  • allows them to solve a wide range of search problems. Apart from a small introductory ... example, applications are selected from problems that arose within machine learning and data mining research ... shown a strong interest in declarative modeling and constraint-solving as opposed to algorithmic approaches ... researchers with such an interest. The first problem is in the domain of stemmatology...
  • IBEX

  • Referenced in 12 articles [sw11947]
  • Ibex is its ability to build strategies declaratively through the contractor programming paradigm ... solver. Two emblematic problems that can be addressed are: System solving. A guaranteed enclosure...
  • Mcmt

  • Referenced in 19 articles [sw11911]
  • modulo theories. We describe mcmt, a fully declarative and deductive symbolic model checker for safety ... points by solving Satisfiability Modulo Theories (SMT) problems. Besides standard SMT techniques, efficient heuristics...
  • cc(FD)

  • Referenced in 17 articles [sw21237]
  • language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over finite domains ... implementation of the combinators. Results on numerous problems, including scheduling, resource allocation, sequencing, packing ... procedural languages on a number of combinatorial problems. In addition, a small cc(FD) program ... problem [29], which was left open for more than 20 years and finally solved...
  • TFad

  • Referenced in 9 articles [sw07478]
  • little more than changes to declarations. Such simple changes can easily give improved results ... solve nonlinear equations. When gradients are required (say, for optimization) and the problem involves many...
  • OPAL

  • Referenced in 6 articles [sw13119]
  • framework that allows to easily declare algorithms and the parameters on which they depend along ... syntax to formulate the optimization problem to be solved. A black-box optimization solver takes...
  • URSA

  • Referenced in 4 articles [sw15541]
  • system for uniform solving of a wide class of problems by reducing them ... specification language URSA that combines imperative and declarative programming paradigms. The reduction ... many NP-complete problems can be simply specified and then solved by the system...
  • MiningZinc

  • Referenced in 3 articles [sw19070]
  • constraint-based mining. We introduce MiningZinc, a declarative framework for constraint-based data mining. MiningZinc ... high-level and natural modeling of mining problems, so that MiningZinc models are similar ... specialized data mining systems. The high-level problem specification is first translated into a normalized ... unique combination of declarative modeling with high-performance solving...
  • Cardinal

  • Referenced in 10 articles [sw06999]
  • solve them efficiently using Cardinal. Results on a set of diagnostic problems show that Cardinal ... cardinality. The Cardinal version just released allows declaring union, minimum and maximum functions...
  • spock

  • Referenced in 5 articles [sw30413]
  • separates the description of a problem from its solving methods. Despite its semantic elegance ... unnatural, since employing imperative solving algorithms would undermine the declarative flavour of ASP. In this...
  • SIMPLY

  • Referenced in 5 articles [sw11807]
  • introduce Simply , a compiler from a declarative language for CSP modeling to the standard ... version of Simply is able to generate problem instances falling into the quantifier free linear ... system for easy CSP modeling and solving. By taking advantage of the year-over-year...
  • Newton

  • Referenced in 6 articles [sw21236]
  • originates from an effort to reconcile the declarative nature of constraint logic programming (CLP) languages ... science and engineering, including nonlinear equation-solving, unconstrained optimization, and constrained optimization. It is competitive ... solving benchmarks and outperforms the interval-based methods we are aware of on optimization problems...
  • TerpreT

  • Referenced in 2 articles [sw29483]
  • alternatives, such as those based on constraint solving from the programming languages community ... domain-specific language for expressing program synthesis problems. TerpreT is similar to a probabilistic programming ... specification of a program representation (declarations of random variables) and an interpreter describing how programs ... relaxations for graphical models, discrete satisfiability solving, and the Sketch program synthesis system. We illustrate...
  • Kima

  • Referenced in 3 articles [sw08979]
  • variable occurrences in the absence of explicit declarations of program properties. Strong moding/typing and constraint ... constraint satisfaction problem with many simple mode/type constraints, and can be solved efficiently. We proposed...
  • Nettle

  • Referenced in 1 article [sw25231]
  • centric approach to solving the complex, low-level, and error-prone problem of network control ... allows programming OpenFlow networks in an elegant, declarative style. Nettle is based on the principles...