diff --git a/README.md b/README.md
index 80f5c2d..83bba29 100644
--- a/README.md
+++ b/README.md
@@ -1,18 +1,116 @@
-# sdd-rs
+# :books: sddrs: Bottom-Up Sentential Decision Diagram Compiler
 
-Bottom-up sentential decision diagram compiler.
+<img align="right" width="150" height="200" src="static/sdd.png" alt="SDD for (A ∧ B) ∨ C">
 
-## Development
+**Incrementally build, manipualate, and optimize
+[Sentential Decision Diagrams (SDD)](https://en.wikipedia.org/wiki/Sentential_decision_diagram):
+a succinct representation of Boolean functions.**
 
-Run all tests and linters with [pre-commit](https://pre-commit.com) before committing.
+## :tada: Features
 
-```bash
-# Install pre-commit: https://pre-commit.com/#install
-brew install pre-commit
+The compiler currently supports:
 
-# Set-up pre-commit
-pre-commit install
+* incremental compilation of Boolean functions (knowledge bases) to SDDs,
+* efficient querying of model count, model enumeration, and equivalence of SDDs
+* dynamic minimization of SDDs via *vtree fragments*,
+* garbage collection of dead nodes,
+* compilation from CNF in
+  [DIMACS](https://www21.in.tum.de/~lammich/2015_SS_Seminar_SAT/resources/dimacs-cnf.pdf) format
 
-# Run all hooks
-pre-commit run --all-files
+
+## Usage
+
+### :package: Library
+
+To use the compiler within a project, add the following line to your Cargo.toml:
+
+```toml
+[dependencies]
+sddrs = { git = "https://github.com/jsfpdn/sdd-rs" }
+```
+
+Then import the crate, initialize an `SddManager` and compile Boolean functions!
+The following snippet compiles the function $(A \land B) \lor C$ to an SDD,
+computes number of its models, enumerates and prints them to the stdout,
+and renders the compiled SDD and its vtree to the DOT format.
+
+```rust
+use sddrs::manager::{options, GCStatistics, SddManager};
+use sddrs::literal::literal::Polarity;
+use bon::arr;
+
+fn main() {
+    let options = options::SddOptions::builder()
+        // Create right-linear vtree.
+        .vtree_strategy(options::VTreeStragey::RightLinear)
+        // Initialize the manager with variables A, B, and C.
+        .variables(!arr["A", "B", "C"])
+        .build();
+    let manager = SddManager::new(options);
+
+    // Retrieve SDDs for literals A, B, and C.
+    let a = manager.literal("A", Polarity::Positive);
+    let b = manager.literal("B", Polarity::Positive);
+    let c = manager.literal("C", Polarity::Positive);
+
+    // Compute "A ∧ B"
+    let a_and_b = manager.conjoin(&a, &b);
+    // Compute "(A ∧ B) ∨ C"
+    let a_and_b_or_c = manager.disjoin(&a_and_b, &c);
+
+    let model_count = manager.model_count(&a_and_b_or_c);
+    let models = manager.model_enumeration(&a_and_b_or_c);
+
+    println!("'(A ∧ B) ∨ C' has {model_count} models.");
+    println!("They are:\n{models}");
+
+    let sdd_path = "my_formula.dot"
+    let f = File::create(sdd_path).unwrap();
+    let mut b = BufWriter::new(f);
+    manager
+        .draw_sdd(&mut b as &mut dyn std::io::Write, &sdd)
+        .unwrap();
+
+    let vtree_path = "my_vtree.dot"
+    let f = File::create(vtree_path).unwrap();
+    let mut b = BufWriter::new(f);
+    manager
+        .draw_vtree_graph(&mut b as &mut dyn std::io::Write)
+        .unwrap();
+
+    println!("Rendered SDD to '{sdd_path}' and vtree to '{vtree_path}'");
+}
+```
+
+### Binary
+
+The compiler can be also compiled and invoked as a command-line utility.
+
+```sh
+cargo build --release
+./target/release/sddrsc \
+    --count-models \
+    --enumerate-models \
+    --vtree right-linear \
+    --minimize-after-k-clauses 2 \
+    --print-statistics \
+    --collect-garbage 0.01 \
+    --sdd.dot \
+```
+
+To render the SDD, install [Graphviz](https://graphviz.org/) and run
+
+```sh
+dot sdd.dot -Tpng -o sdd.png
 ```
+
+## :page_with_curl: Related Links
+
+* [SDD: A New Canonical Representation of Propositional Knowledge Bases - Adnad Darwiche](http://reasoning.cs.ucla.edu/fetch.php?id=121&type=pdf):
+  paper introducing SDDs
+* [Dynamic Minimization of Sentential Decision Diagrams - Arthur Choi and Adnan Darwiche](http://reasoning.cs.ucla.edu/fetch.php?id=128&type=pdf):
+  paper describing dynamic minimization of SDDs
+* [SDD: A New Canonical Representation of Propositional Knowledge Bases – Adnan Darwiche (YouTube tutorial)](https://www.youtube.com/watch?v=_5Estmve91o)
+* [Bottom-Up Knowledge Compilers – Adnan Darwiche (YouTube tutorial)](https://www.youtube.com/watch?v=8yZapazT9Ls)
+* [The SDD Package homepage](http://reasoning.cs.ucla.edu/sdd/): homepage of the original C SDD compiler
+* [RSDD](https://github.com/neuppl/rsdd): alternative implementation of SDD in Rust
diff --git a/easy.png b/static/sdd.png
similarity index 100%
rename from easy.png
rename to static/sdd.png