Inteligencia Artificial

Artificial Intelligence through Prolog by Neil C. Rowe

Artificial Intelligence through Prolog by Neil C.
Rowe
Prentice-Hall, 1988, ISBN 0-13-048679-5
Full text of book (without figures)
Table of Contents
Preface
Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 12
Chapter 13
Chapter 14
Chapter 15Appendix A
Appendix B
Appendix C
Appendix D
Appendix E
Appendix F
Appendix G
Some figures in crude form
Instructor's Manual, containing additional answers and exercises
Errata on the book as published

http://www.cs.nps.navy.mil/people/faculty/rowe/book/book.html [23/04/2002 17:38:27]

http://www.cs.nps.navy.mil/people/faculty/rowe/book/tableconts.html

Table of contents
PrefaceAcknowledgements

To the reader

1. Introduction

1.1 What artificial intelligence is about
1.2 Understanding artificial intelligence
1.3 Preview

2. Representing facts

2.1 Predicates and predicate expressions
2.2 Predicates indicating types
2.3 About types
2.4 Good naming
2.5 Property predicates
2.6 Predicates for relationships
2.7 Semantic networks
2.8 Getting facts from Englishdescriptions
2.9 Predicates with three or more arguments
2.10 Probabilities
2.11 How many facts do we need?

3. Variables and queries

http://www.cs.nps.navy.mil/people/faculty/rowe/book/tableconts.html (1 of 8) [23/04/2002 17:38:31]

http://www.cs.nps.navy.mil/people/faculty/rowe/book/tableconts.html

3.1 Querying the facts
3.2 Queries with one variable
3.3 Multi-directional queries3.4 Matching alternatives
3.5 Multi-condition queries
3.6 Negative predicate expressions
3.7 Some query examples
3.8 Loading a database
3.9 Backtracking
3.10 A harder backtracking example: superbosses
3.11 Backtracking with "not"s
3.12 The generate-and-test scheme
3.13 Backtracking with "or"s (*)
3.14 Implementation of backtracking
3.15 About long examples

4. Definitions andinferences

4.1 Rules for definitions
4.2 Rule and fact order
4.3 Rules as programs
4.4 Rules in natural language
4.5 Rules without right sides
4.6 Postponed binding
4.7 Backtracking with rules
4.8 Transitivity inferences
4.9 Inheritance inferences
4.10 Some implementation problems for transitivity and inheritance
4.11 A longer example: some traffic laws
4.12 Running the traffic lightsprogram
4.13 Declarative programming

5. Arithmetic and lists in Prolog

5.1 Arithmetic comparisons

http://www.cs.nps.navy.mil/people/faculty/rowe/book/tableconts.html (2 of 8) [23/04/2002 17:38:31]

http://www.cs.nps.navy.mil/people/faculty/rowe/book/tableconts.html

5.2
5.3
5.4
5.5
5.6
5.7
5.8
5.9

Arithmetic assignment
Reversing the "is"
Lists in Prolog
Defining somelist-processing predicates
List-creating predicates
Combining list predicates
Redundancy in definitions
An example: dejargonizing bureaucratese (*)

6. Control structures for rule-based systems

6.1 Backward-chaining control structures
6.2 Forward chaining
6.3 A forward chaining example
6.4 Hybrid control structures
6.5 Order variants
6.6 Partitioned control structures
6.7 Meta-rules
6.8Decision lattices
6.9 Concurrency in control structures
6.10 And-or-not lattices
6.11 Randomness in control structures
6.12 Grammars for interpreting languages (*)

7. Implementation of rule-based systems

7.1
7.2
7.3
7.4
7.5
7.6
7.7
7.8
7.9

Implementing backward chaining
Implementing virtual facts in caching
Input coding
Output coding
Intermediate predicates
An exampleprogram
Running the example program
Partitioned rule-based systems
Implementing the rule-cycle hybrid

http://www.cs.nps.navy.mil/people/faculty/rowe/book/tableconts.html (3 of 8) [23/04/2002 17:38:31]

http://www.cs.nps.navy.mil/people/faculty/rowe/book/tableconts.html

7.10
7.11
7.12
7.13
7.14
7.15
7.16
7.17
7.18
7.19

Implementing pure forward chaining (*)
Forward chaining...