https://github.com/tom-tan/azucar-solver

Azucar: a SAT-based CSP solver based on compact order encoding
https://github.com/tom-tan/azucar-solver

Last synced: about 1 month ago
JSON representation

Azucar: a SAT-based CSP solver based on compact order encoding

• Host: GitHub
• URL: https://github.com/tom-tan/azucar-solver
• Owner: tom-tan
• Created: 2015-03-16T05:43:52.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2015-03-16T05:56:49.000Z (almost 10 years ago)
• Last Synced: 2024-10-16T13:34:27.762Z (3 months ago)
• Language: Java
• Homepage:
• Size: 1.64 MB
• Stars: 3
• Watchers: 4
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Azucar: a SAT-based CSP solver based on "compact order encoding"

Azucar is a SAT-based CSP solver which is an enhancement version of [Sugar](http://bach.istc.kobe-u.ac.jp/sugar/) which is an award-winning system of GLOBAL categories of the 2008 and 2009 International CSP solver competitions.

It can solve finite non-linear Constraint Satisfaction Problems (CSP), Constraint Optimization Problems (COP), and Max-CSP over integers.

Azucar uses a new SAT-encoding method named compact order

encoding. In the compact order encoding, each integer is represented

by using a numeral system of any base, and each digit-wise comparison

is encoded by using order encoding.  In the order encoding, a

comparison `x <= a` is encoded by a different Boolean variable for each

integer variable `x` and integer value `a`.