From 0b1acbb02b0c0d742c5284afdcd4a718f8a55867 Mon Sep 17 00:00:00 2001 From: Adnan Ahmed Date: Mon, 6 Dec 2021 23:25:31 +0500 Subject: [PATCH] fix typo --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 08dddc8b..a91a78e9 100644 --- a/README.md +++ b/README.md @@ -27,7 +27,7 @@ Most of these solvers are implemented in C or C++. CDCL(T) is the combination of [CDCL](https://en.wikipedia.org/wiki/Conflict-driven_clause_learning), the leading technique for SAT solving (as popularized by Chaff, minisat, etc. -in the early oughties), and a **theory** T. In practice, SMT solvers _combine_ +in the early eighties), and a **theory** T. In practice, SMT solvers _combine_ multiple theories into one before doing the combination with the SAT solver. Some examples of theories are uninterpreted functions symbols, integer linear arithmetic ("LIA"), rational nonlinear arithmetic ("NRA"), bitvectors for fixed-size