funsat VS presburger

Compare funsat vs presburger and see what are their differences.

funsat

An efficient, embeddable DPLL SAT solver in Haskell (by dbueno)

presburger

Decision procedures for Presburger arithmetic in Haskell (by yav)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
funsat presburger
- -
35 29
- -
0.0 0.0
almost 9 years ago over 3 years ago
Groff Haskell
BSD 3-clause "New" or "Revised" License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

funsat

Posts with mentions or reviews of funsat. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning funsat yet.
Tracking mentions began in Dec 2020.

presburger

Posts with mentions or reviews of presburger. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning presburger yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing funsat and presburger you can also consider the following projects:

incremental-sat-solver - Simple, Incremental SAT Solving as a Haskell Library

graph-generators - A Haskell library for creating random Data.Graph instances using several pop

arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences

twentyseven - Rubik's cube solver in Haskell

Ritt-Wu

lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

build - Build Systems à la Carte

ADPfusionSet - dynamic programming for set data structures

binary-search - Binary and exponential searches