https://github.com/regb/scabolic

Package for a computer algebra system integrated with satisfiability modulo theory algorithms, developed in Scala.
https://github.com/regb/scabolic

Last synced: about 2 months ago
JSON representation

Package for a computer algebra system integrated with satisfiability modulo theory algorithms, developed in Scala.

• Host: GitHub
• URL: https://github.com/regb/scabolic
• Owner: regb
• License: mit
• Created: 2012-02-15T05:49:25.000Z (almost 13 years ago)
• Default Branch: master
• Last Pushed: 2014-12-10T16:07:44.000Z (about 10 years ago)
• Last Synced: 2023-03-22T16:29:09.771Z (almost 2 years ago)
• Language: Scala
• Homepage:
• Size: 8.44 MB
• Stars: 32
• Watchers: 7
• Forks: 4
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
#SCABOLIC

This is the official repository for the Scabolic source code. The aim of

Scabolic is to combine in a single tool/library several automated reasoning

algorithms. In particular this should (soon) support SAT/SMT solving as well as

features from computer algebra.

Scabolic is written in the Scala programming language and provide (well, it

will provide it in the near future) a nice Domain Specific Language (DSL) to be

used either as an interactive tool within the Scala REPL or as a Scala library.

Currently, Scabolic provides two documented interfaces:

- The CafeSat tool

- A Scala API to use inner SAT solver

##Setup

This project depends on the

[Scala-SMTLIB](https://github.com/regb/scala-smtlib) library, which need to be

separately built from the repository and its jar added to the classpath.

To build Scabolic simply type:

    sbt package

##CafeSat



  



CafeSat is the tool interface to the SMT solver in Scabolic. To build CafeSat:

    sbt clean

    sbt compile

    sbt cafesat

Then you can use CafeSat as follows:

    ./target/cafesat [ OPTIONS ] { INPUT ]

If no INPUT is specified, then CafeSat will expect SMT-LIB commands on the standard input, which

is the standard behaviour of the SMT-LIB specifications. If an input is specified, then it will

be parsed as an SMT-LIB script, and fully interpreted. Options can be used to modify this behaviour,

for example the --demacs option will interpret the INPUT file in Dimacs CNF format.

The [Scala'13 paper](http://dx.doi.org/10.1145/2489837.2489839) gives a short overview

of CafeSat.

###Examples

To start an interactive session in the REPL with SMT-LIB:

    ./cafesat

To execute an SMT-LIB script you can do the following:

    ./cafesat < input.smt2

which simply transparently redirect stdin to the content of the file. Or use:

    ./cafesat input.smt2

in which CafeSat will open the file before feeding it to the SMT solver.

To solve Dimacs SAT problems, use:

    ./cafesat --dimacs input.cnf

##Scala API

Scabolic exports a mini API usable from Scala programs. The API is not stable

yet and is expected to change frequently. It will not be backward compatible.

The best way to learn the API is to look at the examples in the apps branch of

this repository.

##Licence

Scabolic is distributed under the terms of The MIT License.

All source code in this repository is distributed under this license. The

reference text is in the file LICENSE, no copy of the text shall be included in

any of the source file, but it is implicitly assumed they are available under

the terms specified in LICENSE.

BY COMMITTING TO THIS REPOSITORY, YOU ACCEPT TO RELEASE YOUR CODE UNDER

THE TERMS OF THE MIT LICENSE AS DESCRIBE IN THE LICENSE FILE.

##Copyright

The copyright for each portion of code is owned by the respective committer,

based on the git history. There is no per file or per function copyright as

this does not make sense in general. Sorry to be picky, but that's copyright

law for you. More information can be found in the COPYRIGHT.md file.