Search Results for "open tax solver"

JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling of combinatorial problems, as well as modular design of search. Documentation is available at project Web site. Please, note that the sources from version 4.0 are only available at GitHub.

GNU Prolog is a free implementation (under GPL) of the logic programming language PROLOG. It can compile to native machine code which is extremely fast in execution. Another feature is the included constraint solver.

... and a problem solver provides a range of algorithms. These can also be used separately, but advanced programming and configuration is required. A free All-in-One GUI allows you to manage services and function, and add your own modules. Example Apps are included and the images illustrate the functionality. The open source p2p server requires only the HTTP address and optional passwords. Small jar file sizes and mobile compatible.

dlvhex is a prototype solver for HEX-programs which integrate Answer-Set Programs with higher-order reasoning and external computation sources. It comes with a full-fledged plug-in framework for rapid extension development.

EasyCP is a modern, user-friendly C++ library that lets you use constraint programming in a very natural way, taking advantage of its expressive power. Just model and let the CSP (Constraint Satisfaction Problem) solver do the job !

CSPFJ or CSP4J is an simple, hopefully fast CSP solver API written in Java featuring state-of-art search algorithms

A prototype solver for computing partial equilibria of Distributed Nonmonotonic Multi-Context Systems (MCS).

A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.

Moved to github: https://github.com/claycephus/MineSweeperWhiz Artificial intelligence solver as well as a human-playable mode for Mine Sweeper.

The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.

A modular SAT solver based on Minisat. The modules are described in XML-files, which are processed by a perl script; thus generating n-solvers.

JASPWrapper is a potential "universal" java wrapper for ASP (answer set programming) inferential engine. It invokes native compiled solver and grounder by Java Virtual Machine and computes answers set analyzing and reifying output stream.

The horn++ library allows you to solve logical expressions in C++. The expressions must be transformed to horn clauses, which can be written as C++ expressions. The solver uses backtracking to find a solution for the logical problem.

A Constraint Programming engine with many examples (planning, sudoku solver...)

YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).

VKAS uses genetic programming methods to find out the relationship among a set of independent and dependent variable. It is a problem solver software which uses evolutionary computing methods. When vkas is run, it creates a population of chromosomes at random. This population is then genetically modified and next population is generated. Each population is subjected to fitness calculation and if a suitable answer chromosome is found then vkas stops and the answer is printed. If a suitable...

Csolve is a constraint solver compiler. It compiles a set of constraints into an arc-consistency algorithm. Generated output is in the C language and can be linked with existing code. Csolve also contains libraries for standard instantiation method

Tool for comparing an answer set solver against another (reference) solver.