Introduction to MiniSAT

Slides:



Advertisements
Similar presentations
Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Winter 2012 Duration: Semester.
Advertisements

CISC 673 : Optimizing Compilers Dept of Computer & Information Sciences University of Delaware JikesRVM.
Linux Platform  Download the source tar ball from the BLAST source code link  ncbi-blast src.tar.gz  Compilation  cd /BLASTdirectory/c++ ./configure.
Feedback Control Systems (FCS)
Reproducible Environment for Scientific Applications (Lab session) Tak-Lon (Stephen) Wu.
SAT Solver Math Foundations of Computer Science. 2 Boolean Expressions  A Boolean expression is a Boolean function  Any Boolean function can be written.
CISC 673 : Optimizing Compilers Dept of Computer & Information Sciences University of Delaware JikesRVM.
Help session: Unix basics Keith 9/9/2011. Login in Unix lab  User name: ug0xx Password: ece321 (initial)  The password will not be displayed on the.
Large-scale Hybrid Parallel SAT Solving Nishant Totla, Aditya Devarakonda, Sanjit Seshia.
GAMS Anwendung Nutzeroberfläche eigene Programme Modellierungs- System GAMS AMPL ILOG Studio … Solver CPLEX, CONOPT, MINOS, COIN, BARON,...
MBSat Satisfiability Program and Heuristics Brief Overview VLSI Testing B Marc Boulé April 2001 McGill University Electrical and Computer Engineering.
Assignments in 1st semester course „OOP with Java“ as small projects
NHSC PACS How to Use getObservation And saveObservation To Access and Save Herschel Data in HIPE Yi Mei (NHSC/Caltech) Y. Mei NHSC Data Workshop – August.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module Logic Representations.
Writing Scripts Hadi Otrok COEN 346.
A brief introduction to javadoc and doxygen. What’s in a program file? 1. Comments 2. Code.
ZHT Hands-on tutorial How to install, configure and run ZHT on a multi-nodes cluster.
Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub- Model Gábor Kusper Eszterházy Károly.
Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Spring 2012 Duration: Semester.
Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM Started at: Spring 2012 Duration: Semester.
1 More About HTML Images and Links. 22 Objectives You will be able to Include images in your HTML page. Create links to other pages on your HTML page.
Satisfiability and SAT Solvers CS 270 Math Foundations of CS Jeremy Johnson.
Tutorial on setting up Zebra: A Z39.50 Server ARD Prasad DRTC Indian Statistical Institute Bangalore.
Debugging Lab Antonio Gómez-Iglesias Texas Advanced Computing Center.
University of Kansas Department of Electrical Engineering and Computer Science Dr. Susan Gauch April 21, 2005 I T T C Introduction to Web Technologies.
2.3 Output Formatting. Outputting Format Specify the number of spaces, “c”, used to print an integer value with specifier %cd, e.g., %3d, %4d. E.g. printf.
OpenMP Lab Antonio Gómez-Iglesias Texas Advanced Computing Center.
Papeete, French Polynesia
VLSI Synthesis and Simulation Tools Nitin Yogi 01/09/2009
Outline Installing Gem5 SPEC2006 for Gem5 Configuring Gem5.
Concurrent Versions System User guide for CS408
How to change the LOGO on PecStarWeb V3.6
Integrative Genomics Viewer (IGV)
3 Introduction to Classes and Objects.
Algorithms Problem: Write pseudocode for a program that keeps asking the user to input integers until the user enters zero, and then determines and outputs.
Hard Problems Introduction to NP
Pre-processor Directives
Introduction to ligo_viewer
Introduction to javadoc
Clause Learning and Intelligent Backtracking in MiniSAT
Notes Over 2.1 Function {- 3, - 1, 1, 2 } { 0, 2, 5 }
Topics Introduction to File Input and Output
Use of Mathematics using Technology (Maltlab)
Compilers, Make and SubVersion
Modeling Sudoku as a CNF Formula
Introduction to the Boolean Satisfiability Problem
Govt. Polytechnic,Dhangar
Unit Propagation and Variable Ordering in MiniSAT
Clause Learning and Intelligent Backtracking in MiniSAT
Modeling Sudoku as a CNF Formula
Unit Propagation and Variable Ordering in MiniSAT
UNIX/LINUX Commands Using BASH Copyright © 2017 – Curt Hill.
Introduction to the Boolean Satisfiability Problem
NP-Complete Problems.
Introduction to MiniSAT
Tutorial Unix Command & Makefile CIS 5027
Implementation of a Functional Programming Language
Operating System Fundamentals
Introduction to javadoc
Experiment No. (1) - an introduction to MATLAB
Clause Learning and Intelligent Backtracking in MiniSAT
Modeling Sudoku as a CNF Formula
OPERATING SYSTEM B-TECH III YEAR I SEM BRANCH :ECE
Running a Java Program using Blue Jay.
Topics Introduction to File Input and Output
CSCE 206 Lab Structured Programming in C
The Python interpreter
Functions What is a function? What are the different ways to represent a function?
CMPSC 60: Week 5 Discussion
Lecture 23 NP-Hard Problems
Presentation transcript:

Introduction to MiniSAT Spring 2017 CSCE 235H Introduction to Discrete Structures URL: cse.unl.edu/~cse235h All questions: Piazza

The MiniSAT Solver ‘Minimalistic,’ open-source SAT solver Designed to be easy to learn and modify Highly performant: has won SAT competitions Used as the backend for many projects

Setting up MiniSAT (1) Access the MiniSAT webpage at http://minisat.se/MiniSat.html

wget http://minisat.se/downloads/minisat-2.2.0.tar.gz Setting up MiniSAT (2) Download the file minisat-2.2.0.tar.gz Copy the file to the CSE server OR Login to the CSE server Download the file directly wget http://minisat.se/downloads/minisat-2.2.0.tar.gz

Setting up MiniSAT (3) Untar the MiniSAT files tar -zxvf minisat-2.2.0.tar.gz Enter the minisat directory cd minisat Set the MROOT environment variable to the full path to the minisat directory (only required for compilation) setenv MROOT <full path to minisat>

Setting up MiniSAT (4) Enter the core directory cd core Compile the program using make make The minisat executable is now located in the core directory

./minisat [options] <input-file> <result-output-file> Using MiniSAT Command usage ./minisat [options] <input-file> <result-output-file> See full listing of options ./minisat --help

DIMACS CNF format (1) Created by the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) Standard format for expressing CNF formulas Human-readable text file

DIMACS CNF format (2) Comments start with a ‘c’ Each line expresses one clause and must end with a ‘0’ Parameters line starts with a ‘p’ and indicates cnf format, 5 variables, 3 clauses Variables must be non-zero numbers. Negated variables have a minus sign

SATLIB benchmark problems (1) Access the SATLIB webpage at http://www.cs.ubc.ca/~hoos/SATLIB/benchm.html

SATLIB benchmark problems (2) Repository of SAT benchmark problems Used the evaluate and compare solvers Taken from a variety of domains E.g., randomly generated, puzzles, coloring graph, planning, etc. Descriptions of the benchmarks are included

SATLIB benchmark problems (3) ALERT Some instances may have extra lines that cannot be parsed by MiniSAT. Delete any line starting with ‘%’ and all following lines.