Write an introduction

bibliography.bib

@@ -0,0 +1,27 @@
+
+@Misc{common_lisp_wikib,
+	url = {https://en.wikibooks.org/wiki/Common_Lisp},
+	title = {Common Lisp WikiBook}
+}
+
+@Book{klenk08:_under_symbol_logic,
+	year = {2008},
+	publisher = {Pearson Education, Inc.},
+	title = {Understanding Symbolic Logic, Fifth Edition},
+	author = {Virginia Klenk}
+}
+
+@Misc{pitmann05:_common_lisp_hyper,
+	url = {http://www.lispworks.com/documentation/HyperSpec/Front/index.htm},
+	year = {2005},
+	title = {The Common Lisp Hyperspec},
+	author = {Kent Pitman}
+}
+
+@Book{seibel05:_pract_common_lisp,
+	year = {2005},
+	publisher = {Apress},
+	title = {Practical COMMON LISP},
+	author = {Peter Seibel}
+}
+

symbolic-sat.org

@@ -35,7 +35,17 @@
     (org-babel-tangle))
 #+END_SRC
 
-* TODO Introduction
+* DONE Introduction                                                   :nonum:
+CLOSED: [2018-03-17 Sat 23:00]
+
+The following describes and implements a SAT solver for the five most common logical connectives ($\{\lnot, \land, \lor, \Rightarrow, \Leftrightarrow\}$).  It does so using the Tree Rules for Sentential Logic as described in \cite{klenk08:_under_symbol_logic}.  While it is written first and foremost for programmers and computer scientists, it's also an attempt at a well-documented program that would likely be of interest to logicians who seek to understand more about the actual construction of computer programs.  The organization is as follows:
+
+ 1. Description and implementation of the Solver.  Although this builds on things defined later, this section is the bulk of the document and also the most interesting.
+ 2. A definition of an Expression Classifier.  This is used by the solver to help decide what steps to make as it attempts to solve a given instance of the SAT problem.
+ 3. A description of several utilities used in the Solver.  These utilities are not particularly interesting, but do help to abstract away certain common tasks used in the main solver.
+ 4. A description of how the software is packaged as a library.  This in and of itself is rather mundane, however it should help to further demonstrate the organization of software.
+
+This SAT solver is written in a language called Common Lisp (\cite{pitmann05:_common_lisp_hyper}), known well in the AI community.  For those unfamiliar, aside from the previously cited source several good resources are available (\cite{common_lisp_wikib,seibel05:_pract_common_lisp}).
 
 * TOC                                                                :ignore:
 
@@ -479,3 +489,8 @@
                  (:file "utils")
                  (:file "solver")))
 #+END_SRC
+
+* Bibliography                                                       :ignore:
+
+\bibliographystyle{plain}
+\bibliography{bibliography}