Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
tutorials:beginner:cram_prolog [2016/01/25 11:47] – gkazhoyatutorials:beginner:cram_prolog [2022/05/26 12:32] (current) – [Using built-in predicates] schimpf
Line 1: Line 1:
 ====== Using Prolog for reasoning ====== ====== Using Prolog for reasoning ======
  
 +**Description:** In this tutorial you will learn how the Prolog interpreter that we have inside of CRAM works, what does the syntax look like and what it is at all useful for.
 +
 +**Previous Tutorial:** [[tutorials:beginner:simple_plans|Implementing simple plans to move a turtle]]\\
 +**Next Tutorial:** [[tutorials:beginner:motion_designators|Creating motion designators for the TurtleSim]]
 ==== Using built-in predicates ==== ==== Using built-in predicates ====
  
Line 27: Line 31:
 (((?X . 1)) ((?X . 2)) ((?X . 3))) (((?X . 1)) ((?X . 2)) ((?X . 3)))
 </code> </code>
 +
 +=== Using unbound variables ===
  
 Variables in CRAM Prolog are represented by any symbol that starts with ''?'' (question mark). \\ Variables in CRAM Prolog are represented by any symbol that starts with ''?'' (question mark). \\
Line 40: Line 46:
 Then we get one correct possible assignment for all the variables as one entry of the lazy list. Then we get one correct possible assignment for all the variables as one entry of the lazy list.
  
 +It is important to remember that the ` is needed for unbound variables, not the ' or you will get an error.
 +
 +=== No solution ===
 If there are no solutions for the query Prolog returns NIL: If there are no solutions for the query Prolog returns NIL:
 <code lisp> <code lisp>
Line 52: Line 61:
 (NIL) (NIL)
 </code> </code>
 +=== Using lisp with prolog code ===
 The CRAM Prolog interpreter finds solutions by performing a depth first search over the predicate tree, that it, it first searches for possible bindings for the first predicate, then branches into multiple search paths, one per each assignment, and continues with the second predicate, and so on. The mechanism is the same as in any other Prolog implementation. The CRAM Prolog interpreter finds solutions by performing a depth first search over the predicate tree, that it, it first searches for possible bindings for the first predicate, then branches into multiple search paths, one per each assignment, and continues with the second predicate, and so on. The mechanism is the same as in any other Prolog implementation.
  
Line 100: Line 109:
 (((?PARENT-OF-ME . MY-DAD) (?GRANDPARENT-OF-MY-KID . MY-DAD))) (((?PARENT-OF-ME . MY-DAD) (?GRANDPARENT-OF-MY-KID . MY-DAD)))
 </code> </code>
 +
 +
 +Now that we are familiar with the CRAM Prolog syntax, let's dive right into resolving CRAM abstract entity descriptions, called designators, using Prolog ...
 +
 +**Next Tutorial:** [[tutorials:beginner:motion_designators|Creating motion designators for the TurtleSim]]