Select a tag to browse associated projects and drill deeper into the tag cloud.
GNU Prolog
Claimed by GNU Analyzed about 13 hours ago
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.
Licenses:
gpl, lgpv3_or_...
OVal - Object Validation for Java 5
Analyzed 1 day ago
OVal is a pragmatic and extensible validation framework for any kind of Java objects (not only JavaBeans).
Constraints can be declared with annotations (@NotNull, @MaxLength), POJOs or XML.
Custom constraints can be expressed as custom Java classes or by using scripting languages such as
Licenses:
eclipse, EPL2
choco
Analyzed over 3 years ago
choco: a java library for constraint satisfaction problems (CSP), constraint programming (CP) and explanation-based constraint solving (e-CP).
Mostly written in language not available
Licenses:
bsd
agimatec-validation
A
Analyzed over 3 years ago
This is one of the first complete implementations of JSR 303 (Bean Validation), a specification of the Java API for JavaBean validation in Java EE and Java SE.
The technical objective is to provide a class level constraint declaration and validation facility for the Java application developer, as
Mostly written in language not available
Licenses:
apache_2
Cassowary
C
Analyzed about 9 hours ago
Cassowary is an incremental constraint solving toolkit that efficiently solves systems of linear equalities and inequalities. Constraints may be either requirements or preferences. Re-solving the system happens rapidly, supporting UI applications.
Licenses:
No declared licenses
Graphistic
Analyzed over 3 years ago
Actuellement, il existe assez peu de programmes permettant de créer facilement des figures géométriques en imposant des propriétés simples sur la forme du résultat (par exemple que deux parties du dessin soient parallèles).
Ce projet propose d'implanter un programme permettant de réaliser des
Mostly written in language not available
Licenses:
gpl
sat-micro-hs
S
No analysis available
A complete (in the logical sense) SAT solver with non-chronological backtracking. This is a Haskell
implementation of (most of) the minimal OCaml solver described in the paper SAT-MICRO: petit mais
costaud! by Sylvain Conchon, Johannes Kanig, and Stephane Lescuyer
Mostly written in language not available
Licenses:
lgpl
CVC4
Analyzed 2 days ago
CVC4 is an efficient open-source automatic theorem prover for satisfiability modulo theories (SMT) problems. It can be used to prove the validity (or, dually, the satisfiability) of first-order formulas in a large number of built-in logical theories and their combination.
Licenses:
BSD-3-Clause
Grid Style Sheets (GSS)
Claimed by TheGrid Analyzed about 1 hour ago
GSS reimagines CSS layout & replaces the browser’s layout engine with one that harnesses the Cassowary Constraint Solver — the same algorithm Apple uses to compute native layout.