Index changes initiated by Martin (#690)

Author: martin-henz

xml/chapter4/section4/subsection3.xml

@@ -468,11 +468,12 @@ and(not(job($x, list("computer", "programmer"))),
  <INDEX>closed world assumption</INDEX>
  <EM>closed world assumption</EM> that all relevant information has been
  included in the data base.<FOOTNOTE>A discussion and justification of this
- treatment of <SCHEMEINLINE>not</SCHEMEINLINE> can be found in the article by
+ treatment of <SCHEMEINLINE>not</SCHEMEINLINE> can be found in the article
+ <INDEX>negation as failure</INDEX>
+ <QUOTE>Negation as Failure</QUOTE> by
  <INDEX>Clark, Keith L.</INDEX>
  Clark (1978).</FOOTNOTE>
  </TEXT>
-
  <INDEX>query interpreter<SUBINDEX>problems with <SCHEMEINLINE>not</SCHEMEINLINE> and <SCHEMEINLINE>javascript_predicate</SCHEMEINLINE><CLOSE/></SUBINDEX></INDEX>
 
  <EXERCISE>

xml/chapter4/section4/subsection4.xml

@@ -1941,6 +1941,10 @@ function unify_match(p1, p2, frame) {
  cyclic references, by accepting the cyclic data structure
  as the result of the match. This is justified
  theoretically using <EM>rational trees</EM>
+ <INDEX>Jaffar, Joxan</INDEX>
+ <INDEX>Stuckey, Peter J.</INDEX>
+ <INDEX>tree<SUBINDEX>rational</SUBINDEX></INDEX>
+ <INDEX>rational tree</INDEX>
  (<CITATION>Jaffar and Stuckey 1986</CITATION>).
  Accepting
  a cyclic data structure allows self-referential data, such