Programming in Prolog is hard for programmers that are used to procedural coding. In this manual the method of drawing search trees is introduced with the aim to get a better understanding of how Prolog works. After giving a first example of a Prolog database, query and search tree, the art of drawing search trees is systematically introduced giving guidelines for queries with variables, conjunction, disjunction, and negation. Further examples are provided by giving the complete search trees that are shown in Learn Prolog Now!

中文翻译：

---

绘制 Prolog 搜索树：逻辑编程师生手册

对于习惯于过程编码的程序员来说，在 Prolog 中编程是很困难的。本手册介绍了绘制搜索树的方法，目的是为了更好地理解 Prolog 的工作原理。在给出 Prolog 数据库、查询和搜索树的第一个示例之后，系统地介绍了绘制搜索树的艺术，为具有变量、合取、析取和否定的查询提供指导。通过提供在 Learn Prolog Now 中显示的完整搜索树来提供更多示例！