https://github.com/boschmitt/satomi
Yet another SAT solver developed in C.
https://github.com/boschmitt/satomi
c sat-solver satisfiability
Last synced: over 1 year ago
JSON representation
Yet another SAT solver developed in C.
- Host: GitHub
- URL: https://github.com/boschmitt/satomi
- Owner: boschmitt
- License: bsd-2-clause
- Created: 2017-05-07T23:34:25.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2017-05-08T14:00:37.000Z (about 9 years ago)
- Last Synced: 2025-01-21T07:27:49.864Z (over 1 year ago)
- Topics: c, sat-solver, satisfiability
- Language: C
- Homepage:
- Size: 63.5 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Satomi
Satomi is a SAT solver developed for my own education as I venture in the world
of EDA and CAD tools. My intent it to evolve this solver as I learn different
approaches and techniques.
## Version 2
## Clauses and Clauses Database
Each clause is represented by its current size and by an array of literals,
both of which are continuously allocated. All clauses are stored in one big array
of 32-bits integers, called **clauses database**. Each clause is created by
reserving the necessary space and returning an index (cref) to its first 32-bit
integer.
A small trick is used to access clauses information: an interface struct is
declared with an zero-sized array at the end:
```c
struct clause {
uint32_t size;
uint32_t lits[0];
};
```
Then a clause handler (`struct clause *`) can be retrived by using the index and
casting the pointer to the first 32-bit integer (`uint32_t *`) to the interface
struct.
## References
Papers:
* Davis, P., and Putnam, H. A Computing Procedure for Quantification Theory.
Journal of the ACM (1960).
* Davis, P., Logemann, G., and Loveland, D. A Machine Program for Theorem Proving.
Communications of the ACM (1962)
* Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik.
2001. Chaff: engineering an efficient SAT solver. In Proceedings of the 38th annual
Design Automation Conference (DAC '01). ACM, New York, NY, USA, 530-535.
* Chu, Geoffrey, Aaron Harwood, and Peter J. Stuckey. "Cache conscious data structures
for boolean satisfiability solvers." Journal on Satisfiability, Boolean Modeling and
Computation 6 (2008): 99-120.
* Sorensson, Niklas. "Minisat 2.2 and minisat++ 1.1." A short description in SAT Race
2010 (2010).
Books:
* The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability by
Donald E. Knuth