remove U+0088 characters

LaTeX was complaining that this codepoint did not exist in the selected font.
They turned out to indicate areas that had garbled list formatting, so fix
the lists and remove the unneeded whitespace character.

Fixes #7.

docs/soar_manual/03_SyntaxOfSoarPrograms.md

@@ -51,10 +51,13 @@ lowercase letters in a case-insensitive manner, for example, when using the
 [`print` command](../reference/cli/cmd_print.md). But internally, they are actually
 uppercase letters.)
 
-- **Constants**: There are three types of constants: integers, floating-point, and symbolic constants: - ˆInteger constants (numbers). The range of values depends on the machine
+- **Constants**: There are three types of constants: integers, floating-point, and symbolic constants: 
+    - Integer constants (numbers). The range of values depends on the machine
   and implementation you’re using, but it is at least [-2 billion...+2
-  billion]. - ˆFloating-point constants (numbers). The range depends on the machine and
-  implementation you’re using. - ˆSymbolic constants. These are symbols with arbitrary names. A constant can use
+  billion]. 
+    - Floating-point constants (numbers). The range depends on the machine and
+  implementation you’re using. 
+    - Symbolic constants. These are symbols with arbitrary names. A constant can use
   any combination of letters, digits, or `$%&*+-/:<=>?_`. Other characters (such as blank
   spaces) can be included by surrounding the complete constant name with vertical
   bars: `|This is a constant|`. (The vertical bars aren’t part of the name; they’re

docs/soar_manual/04_ProceduralKnowledgeLearning.md

@@ -112,15 +112,15 @@ gamut of tests that hand-written rules can and can have any element variablized.
       element.
       - For actions, the three elements refer to the identifier, attribute and
       value of the WME being created.
-- ˆAn element is either a variable, like `<s>` or a literal constant, like `23`,
+- An element is either a variable, like `<s>` or a literal constant, like `23`,
   `3.3`, or `someString`
 
 ### Identity
 
 Before we can discuss the algorithm, we must first define one of its central
 concepts: *identity*.
 
-- ˆ**An identity is the set of all variables in a trace that refer to the same
+- **An identity is the set of all variables in a trace that refer to the same
 underlying object.**
       - So we can say that two *variables* are said to *share an identity* if they
       both refer to the same underlying object.
@@ -527,10 +527,10 @@ To handle this limitation,EBC keeps track of all constraints found in
 non-operational conditions that it encounters while backtracing in the following
 manner:
 
-- ˆIt stores constraints on the value a single identity, for example>= 0,< 23.
-- ˆIt stores relational constraints between two identities, for example>
+- It stores constraints on the value a single identity, for example>= 0,< 23.
+- It stores relational constraints between two identities, for example>
 `<min>`, `< <max>` or `<> <other>`.
-- ˆEBC stores all of these constraints based on the underlying identities, not
+- EBC stores all of these constraints based on the underlying identities, not
 the variables used. For example, if a variable<foo>had the constraint<> <other>,
 EBC would record that the variables that share the identity of<foo>cannot have
 the same value as variables that share the identity of<other>.
@@ -1194,18 +1194,18 @@ See Section 9.4.1 for more detailed information about the chunk command’s sett
 
 By default, explanation-based chunking is off.
 
-- ˆTo turn on chunking: `chunk always`
-- ˆTo turn off chunking: `chunk never`
+- To turn on chunking: `chunk always`
+- To turn off chunking: `chunk never`
 
 In real world agents, there may be certain problem spaces in which you don’t
 want your agent to learn rules. Chunking has a mechanism to allow agents to
 dynamically specify the states in which rules are learned.
 
-- ˆTo turn off chunking in all states except ones manually flagged on:
+- To turn off chunking in all states except ones manually flagged on:
    - Use chunk only setting.
    - Design an agent rule that executes the RHS action force-learn, which only
    matches in states in which you want to learn rules.
--ˆTo turn on chunking in all states except ones manually flagged off:
+- To turn on chunking in all states except ones manually flagged off:
    - Use chunk except setting.
    - Design an agent rule that executes the RHS action dont-learn, which only
    matches in states in which you don’t want to learn rules.
@@ -1267,32 +1267,32 @@ See Section 9.4.1 for more information about the chunk singleton command.
 
 **Printing Rules**
 
-ˆTo print all chunks learned: 
+- To print all chunks learned: 
 `print --chunks` or `print -c`
 
-ˆTo print all justifications learned (and still matching): 
+- To print all justifications learned (and still matching): 
 `print --justifications` or `print -j`
 
-ˆTo print a rule or justification:
+- To print a rule or justification:
 `print <rule-name>`
 
 For more information on print, see section 9.3.1 on page 217.
 
 **Trace Messages**
 
-ˆTo print when new rules are learned (just the name):
+- To print when new rules are learned (just the name):
 `trace --learning 1` or `trace -l 1`
 
-ˆTo print when new rules are learned (the full rule):
+- To print when new rules are learned (the full rule):
 `trace --learning 2` or `trace -l 2`
 
-ˆTo print a trace of the conditions as they are collected during backtracing:
+- To print a trace of the conditions as they are collected during backtracing:
 `trace --backtracing` or `trace -b`
 
-ˆTo print warnings about chunking issues detected while learning:
+- To print warnings about chunking issues detected while learning:
 `trace --chunk-warnings` or `trace -C`
 
-ˆTo print when learned chunks match and fire:
+- To print when learned chunks match and fire:
 `trace --backtracing` or `trace -b`
 
 For more information on trace, see section 9.6.1 on page 259.
@@ -1388,17 +1388,17 @@ mechanism as described in section 9.6.3 on page 269.
 
 #### Interrupting Execution To Examine Learning
 
-ˆTo stop Soar after each successful learning episode:
+- To stop Soar after each successful learning episode:
 ```
 chunk interrupt on
 ```
 
-ˆTo stop Soar after detecting any learning issue:
+- To stop Soar after detecting any learning issue:
 ```
 chunk warning-interrupt on
 ```
 
-ˆTo stop Soar after learning a rule that the explainer recorded:
+- To stop Soar after learning a rule that the explainer recorded:
 ```
 chunk explain-interrupt on
 ```
@@ -1691,4 +1691,4 @@ systems may not allow Soar to launch an external program.
    knowledge, for example, operator selection knowledge.
 - <a name="footnote2">[2]</a>: Justifications can have variables in the negated
    conditions and negated conjunctions of conditions. They just don’t have any
-   variables in its positive conditions. 
+   variables in its positive conditions. 

docs/soar_manual/05_ReinforcementLearning.md

@@ -301,10 +301,12 @@ operator- no-change impasse. When this occurs, the number of decision cycles the
 RL operator at the superstate remains selected is dependent upon the processing
 in the impasse state. Consider the operator trace in Figure 5.1.
 
-ˆAt decision cycle 1, RL operatorO1is selected inS1and causes an
-operator-no-change impass for three decision cycles.  ˆIn the substateS2,
-operatorsO2,O3, andO4are selected and applied sequentially.  ˆMeanwhile inS1,
-rewardsr 2 ,r 3 , andr 4 are put on thereward-linksequentially.  ˆFinally, the
+- At decision cycle 1, RL operatorO1is selected inS1and causes an
+operator-no-change impass for three decision cycles.
+- In the substateS2,
+operatorsO2,O3, andO4are selected and applied sequentially.
+- Meanwhile inS1,
+rewardsr 2 ,r 3 , andr 4 are put on thereward-linksequentially.  - Finally, the
 impasse is resolved by O4, the proposal for O1 is retracted, and RL operatorO5is
 selected inS1.
 
@@ -515,4 +517,4 @@ lowercase names such as $s_1$ will refer to task states.
 **numeric-indifferent-mode** is set to
 **sum**. In general, the RL mechanism only works correctly when this is the
 case, and we assume this case in the rest of the chapter. See page 198 for more
-information about this parameter.
+information about this parameter.