Search Results for "cnf"

Zat is an Onagan project. It is a very fast sat solver for .cnf, .dimacs, ... Zat is an O(n^log(n)) time complexity algorithm, which is faster than O((1+e)^n) for e strictly positive. The space complexity is O(n). The version 1.0 is exclusively for Windows 10.

this program written in Scheme (a Lisp dialect) manipulate logical expressions. Logiki can put any logical expression in disjunctive (DNF) or conjunctive (CNF) normal form and can simplify the expressions,detecting antilogies and tautologies, finding minimal form, you can also display the result in infix notation with or without use of symbols. Author: Damien MATTEI (Nice - France)

... the Logic Calculator displays the truth table of each premise / conclusion and the result of whether or not these premises logically entail the given conclusions. (3) Conversion of a formula to Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF): In this mode the user inserts a logic formula and the Logic Calculator outputs its representation in both a DNF and CNF.

This small application aims to to help the user take structured plain text notes one at a time. By design, the application aim to be as simple as possible to take a note without being distracted by bells and whistles. The application can also be used to record todos and journal entries. They are structured because they have consistent names ([type]-timestamp.txt), stored in one configurable path, and, optionally, their contents follow predefined formats (see the cnf file).

Code to generate large 3 CNF equations Code to solve large 3 CNF equations Solving does not employ VSAT, but VSAT is optional at the end to check the solution.

Gerador aleatório de problemas no formato padrão cnf, com N átomos e M cláusulas, e as cláusulas todas possuem K-literais. K, N e M são parâmetros a serem passados ao gerador.

A Java library for encoding pseudo-Boolean constraints into CNF formulea.

Gerador aleatório de fórmulas de HORN no formato padrão cnf, com N átomos e M cláusulas, e K-literais.

c++ tools to convert any boolean formula to CNF or DNF, and make basic simplification. Please keep in mind that i'm still a student, and i'm open for any advice, criticism or question.

During a course at University "La Sapienza" in Rome I developed a fully working SAT solver based on unit propagation and backtracking; it can read DIMACS files and process cnf formulas of any length(there are no restrictions on the number of literals).

AI Magik is a templatized C++ library providing basic predictors for supervised learning as reusable modules. Currently, the library features CNF Predictor, DNF predictor, decision tree, naive bayes, linear separator and SVM based predictors.

This is an academic project; the main objective is to generate an algorithm to parallelize a CNF formula and then feed the distributed parts to sequential SAT solvers, for this project we have choose to use Sat4J as the solver.

myQueryLogger enables realtime analisys of query traffic. It runs in the background and can capture queries to a log file with user, database info, timestamp. The capture filter can be changed without restarting mysql or the logger by updating cnf file

CNF-toolkit is a simple library for constructing and manipulating boolean formulae in conjunctive normal form.

Tiger Solver is a sat-solver written in C. Using the DPLL algorithm and reading file in DIMACS format (cnf boolean expression). Tiger Solver use most features of many important sat-solver: - Double watches list - Chronological Backtracking ....