Search Results for "or clp"

The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques.

PascalSCADA is a set of components (framework) for Delphi/Lazarus to make easy the development of industrial applications (HMI=Human Machine Interface/SCADA=System Control And Data Acquisition). It runs on Windows, Linux and FreeBSD.

It is a simple calculator for solving problems using Constraint Logic Programming. Thanks to it, we can quickly see solution of: - Combinatory problem (Einstein's Riddle) - Scheduling problem (Museum of Art) - Optimization problems (Map Coloring)

---------------- cqusat 1.0 ---------------- cqusat is a conbstraint solver decides the satisfiability of a set of sentences containing Counting Quantifiers over Unary predicates. It also accepts Universally quantifies sentences over unary predicates, which are presented in the form of propositional clauses (classical Boolean logic clauses). This implementation employs minisat as the SAT solver. It also emplouys COIN-OR Clp linear programming solver...

The Yap Prolog System is a ISO-compatible high-performance Prolog compiler. Yap is widely considered one of the fastest available Prolog systems. Yap supports coroutining, CLP(QR), CHR, and depth-bound search. Tabling and parallelism are in development.

GUI for management Samsung proprietary drivers (printscan) For Samsung series: CLP-300 CLP-310 CLP-340 CLP-350 CLP-500 CLP-510 CLP-550 CLP-600 CLP-610 CLP-620 CLP-650 CLP-660 CLP-670 CLP-770 CLX-216x CLX-3160 CLX-3170 CLX-3180 CLX-3240 CLX-6200 CLX-6220 CLX-6240 CLX-6250 CLX-8380 CLX-8385 CLX-8540 CLX-9250 mfp560 mfp65x mfp750 ML-1450 ML-1510 ML-1520 ML-1610 ML-1630 ML-1630 ML-1640 ML-1660 ML-1710 ML-1740 ML-1750 ML-191x ML-2010 ML-2150 ML-2150 ML-2240 ML-2245 ML-2250 ML-2510 ML-2525 ML-2550...

Lightweight C++ set of utility classes including POSIX/GNU-compatible command-line argument parser, thread-safe logging service, and various utiliy classes ... Motto: simple and user-friendly!

Yadlr is a toolset for many-valued inference, both deductive and inductive. It features a fuzzy reasoner, using CLP(Q,R) to implement fuzzy algebra on top of a resolution-based back-end. It also features Prodlr, an ILP system targeted at learning Description Logics and threaded-variable theories, like DCGs.

CollagenFinder (CF) is a software tool for searching CLP sequences in the given nucleotide sequence. CF scans nucleotide sequence in all six possible reading frames. The additional filter procedures provide more accurate CLP prediction: - detecting for a tryptophan residue and stop-codons and removing corresponding CLPs, - cutoff value by GXY repeat number. If we need CLP with length 36 and more we should use cutoff value equal to 4.

Command line parameters parser, calls corresponding user functions and, if necessary, checks type/semantic of values of inputed parameters. Uses Boost C++ libraries.

swIMP (swig-based Interfaces for Mathematical Programming) provides Java wrappers for solvers written in C or C++. The current focus is on accessing OSI-compatible linear programming (LP) solvers from the Coin-OR-project (e.g. Clp, GLPK, MOSEK, CPLEX).

The AgendaNutricional software uses Simplex Method (provided by CLP component) to calculate which product will be part of a dietetic prescription, based upon the nutrients needed for daily consumption. See "Documentation" for more info.

PuLP: An LP modeller in Python PuLP is an LP modeller written in python. PuLP can generate MPS or LP files and call GLPK, COIN CLP/CBC, CPLEX and XPRESS to solve linear problems.

A Controlled Language Programming (CLP) compiler, runtime engine, and development IDE for writing software in a natural (but somewhat restricted) language that clearly represents the real world concerns and maps to a 3GL (Java/Groovy) for execution.

Learn basic constraint logic programming by solving logic word puzzles. Go to http://eclipse.dougedmunds.com . This tutorial will show you how to solve easy 1 star to hard 5 star puzzles, using the eCLiPSe-CLP language (available at http://eclipseclp.org/). Don't confuse this programming language (a prolog language) with the IDE for Java.