Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

GNU Prolog

Compare

  Analyzed 4 months 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.

323K lines of code

0 current contributors

about 2 years since last commit

9 users on Open Hub

Activity Not Available
5.0
 
I Use This
Licenses: GPL-2.0+, LGPL-3.0+

agimatec-validation

Compare

  Analyzed about 1 year 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 ... [More] well as a constraint metadata repository and query API. This implementation is based on the validation framework of agimatec GmbH, a small validation framework that is in production since 2007 and offers additional features, like XML-based extensible metadata, code generation (JSON for AJAX applications). For more information refer to the Wiki at Overview or contact us. 17 march 2010: agimatec-validation sources are now hosted on http://svn.apache.org/repos/asf/incubator/bval/. Dependencies, API documentationJSR303 specification agimatec-validation - Maven-site with dependencies agimatec-validation - JavaDoc agimatec-jsr303 - Maven-site with dependencies agimatec-jsr303 - JavaDoc [Less]

12.9K lines of code

0 current contributors

almost 7 years since last commit

2 users on Open Hub

Activity Not Available
4.0
   
I Use This

choco

Compare

  Analyzed about 2 months ago

choco: a java library for constraint satisfaction problems (CSP), constraint programming (CP) and explanation-based constraint solving (e-CP).

665K lines of code

0 current contributors

almost 3 years since last commit

2 users on Open Hub

Activity Not Available
5.0
 
I Use This

Cassowary

Compare

  Analyzed 10 months 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.

106K lines of code

0 current contributors

about 6 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This
Licenses: No declared licenses

geoz

Compare

  Analyzed about 1 year ago

Soon

35K lines of code

0 current contributors

over 10 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

sat-micro-hs

Compare

  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

0 lines of code

0 current contributors

0 since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: LGPL

Graphistic

Compare

  Analyzed about 1 year 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 ... [More] figures géométriques en deux dimensions avec des possibilités de manipulation et de rendu efficaces. Par le terme de figure géométrique, on entend un arrangement dans le plan d'objets géométriques simples (points, droites, cercles ...) reliés entre eux par des relations géométriques (angles, longueur ...). La manipulation de ces figures consiste à pouvoir modifier les composantes de la figure géométrique (que ce soient les objets ou les relations), et le rendu consiste à pouvoir créer des images aya [Less]

22.9K lines of code

0 current contributors

over 5 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

CVC4

Compare

  Analyzed over 4 years 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.

340K lines of code

10 current contributors

over 4 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This

cassowary.js

Compare

  Analyzed about 2 months ago

Cassowary/JS, better, faster, future-ready

9.53K lines of code

0 current contributors

about 2 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

Grid Style Sheets (GSS)

Compare

Claimed by TheGrid Analyzed about 22 hours 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.

25.6K lines of code

2 current contributors

9 months since last commit

1 users on Open Hub

Very Low Activity
0.0
 
I Use This