I am trying to put together a brief paragraph which instructs on the use of Boolian Logic for the lay user. I have gotten this far. I do not have an understanding of how ht/dig uses the "()" and how it deals with capitals and lowercase, quote marks, and + and - . Any information, examples of how others have done this, helpful examples to use, suggestions, explanations, help would be appreciated, thank you. Using Boolean Logic This search engine uses a symbolic logic system called Boolean Logic, named after George Boole, the French mathemetician who invented it. It uses a simple parser that knows how to deal with "not", "and", "or" and parenthesis. The result of the parser is one set of matches. word AND word = both words must appear in the document; San AND Francisco word OR word = use this to find variations on a word or concept, documents with either word will appear in the search results word NOT word = Note that the operator "not" is used as the word 'without' and requires a search-word on either end: You cannot write "cat and not dog" or just "not dog" but you can write "cat not dog". Best Wishes! Michael Olds Los Altos California www.BuddhaDust.org ICQ#94992160 _______________________________________________ htdig-general mailing list <[EMAIL PROTECTED]> To unsubscribe, send a message to <[EMAIL PROTECTED]> with a subject of unsubscribe FAQ: http://htdig.sourceforge.net/FAQ.html
