Goal Searching and its Control

  • M. S. Dawe
  • C. M. Dawe


When answering a query and searching for a goal, Prolog looks for a match where the predicates and their arguments are the same as in the query. This match can be from the database, or any intermediate places along the search path. Put another way, attempts are made to find a clause in the database from which the goal follows. If there is a successful match, Prolog will respond with yes. Alternatively if terms are not identical, variables may be instantiated. An integer or atom will match only itself. A more complicated structure will match another structure with the same relation and arity, provided that all corresponding arguments match.


Search Tree Control Word Search Path Control Predicate Successful Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 1994

Authors and Affiliations

  • M. S. Dawe
    • 1
  • C. M. Dawe
    • 2
  1. 1.Department of Computer ScienceUniversity of ManchesterManchesterUK
  2. 2.Birch Tree HouseKentUK

Personalised recommendations