Prolog Programming for Artificial IntelligenceAddison-Wesley, 1986 - 423 pages The Prolog language; An overview of Prolog; Syntax and meaning of Prolog programs; Lists, operators, arithmetic; Using structures: example programs; Controlling backtracking; Input and output; More built-in procedures; Programming style and technique; Prolog in artificial intelligence; Operations on data structures; Advanced tree representations; Basic problem-solving strategies; Best first: a heuristic search principle; Problem reduction and AND/OR graphs; Expert systems. Game playing; Pattern-directed programming. |
Table des matières
PART ONE THE PROLOG LANGUAGE | 1 |
Syntax and Meaning of Prolog Programs | 27 |
Lists Operators Arithmetic | 64 |
Droits d'auteur | |
15 autres sections non affichées
Autres éditions - Tout afficher
Expressions et termes fréquents
advice-table algorithm alpha-beta AND/OR graph Answer arcs arguments Artificial Intelligence askable atom backtracking best-first search binary dictionary binary relation binary tree Bound breadth-first search built-in candidate canget chapter chess clause computation conc corresponding cost database declarative meaning delete depth-first depth-first search digits efficiency eight queens eight queens problem example execution expand expert system explore f-value formulation functor game tree goal list goal node Goal2 Goall greatest common divisor heuristic illustrates implementation input insert instantiated integer Item List1 List2 matching minimax modules move NewTree notation objects operator output parent path path1 pattern-directed permutation Pos1 position predecessor predicate prior probability problem procedure program of Figure Prolog programs question quicksort representation represented root RootPos rules satisfy search tree sequence shown in Figure solution tree solve specified structure successor Tail Term Term1 Trace Tree1 true useranswer variables write