Table of contents

• Part I: Foundations
  • 1 Preliminaries
    • 1.1 Downloading and installing the Prolog+CG environment
  • 2 The Prolog+CG environment
    • 2.1 The Prolog+CG screen
    • 2.2 The Prolog development cycle
    • 2.3 Daily Prolog+CG usage
    • 2.4 File manipulation
    • 2.5 Summary
• Part II: CGs
  • 3 Concept types and instances
    • 3.1 Concept types and type-hierarchies in Prolog+CG
      • 3.1.1 Syntax
      • 3.1.2 Example
      • 3.1.3 Multiple inheritance
      • 3.1.4 Universal and Absurd
      • 3.1.5 Identifiers
      • 3.1.6 Further rules
      • 3.1.7 Summary
    • 3.2 Concept type instances in Prolog+CG
      • 3.2.1 The rules
      • 3.2.2 Examples
      • 3.2.3 Further rules
      • 3.2.4 Summary
    • 3.3 Quiz: Concept types and instances
  • 4 CG syntax
    • 4.1 Relations
      • 4.1.1 Further rules
      • 4.1.2 Variables
      • 4.1.3 Summary
    • 4.2 Arcs
    • 4.3 Concepts
      • 4.3.1 Concept types
      • 4.3.2 Referents
        • 4.3.2.1 Identifiers and strings
        • 4.3.2.2 Variables
        • 4.3.2.3 Multi-referents
      • 4.3.3 Concept descriptors
      • 4.3.4 Summary
    • 4.4 Multi-line graphs
    • 4.5 Coreferents
    • 4.6 Quiz: CG Syntax
  • 5 CG primitives
    • 5.1 CG goals
      • 5.1.1 branchOfCG
      • 5.1.2 concOfCG
      • 5.1.3 subsume
      • 5.1.4 generalize
      • 5.1.5 maximalJoin
    • 5.2 Type goals
      • 5.2.1 isSubType
      • 5.2.2 isSuperType
      • 5.2.3 isInstance
      • 5.2.4 superTypes
      • 5.2.5 immediateSubTypes
      • 5.2.6 maxComSubType
      • 5.2.7 minComSuperType
  • 6 Prolog for CG users
    • 6.1 Atoms, Strings, and Numbers
    • 6.2 Structures, relationships and terms
    • 6.3 Variables
    • 6.4 Facts
    • 6.5 Rules, Goals and Subgoals
    • 6.6 Clauses and predicates
    • 6.7 Matching
    • 6.8 Queries
    • 6.9 Lists
  • 7 Formalizing texts
    • 7.1 Nuts and bolts
      • 7.1.1 Organizing the knowledge base
      • 7.1.2 Organizing the graphs
      • 7.1.3 Writing the graphs
      • 7.1.4 The ontology
      • 7.1.5 Predicates
      • 7.1.6 Adding knowledge
    • 7.2 Templates
      • 7.2.1 Act
      • 7.2.2 Utterance
      • 7.2.3 AND
      • 7.2.4 If/Then
      • 7.2.5 Non-literal expressions (Ad)
    • 7.3 Examples
      • 7.3.1 Lion and Mouse
      • 7.3.2 Macbeth 1
      • 7.3.3 Macbeth 2
      • 7.3.4 Garfield
      • 7.3.5 branchOfCG
      • 7.3.6 concOfCG
      • 7.3.7 Conflict-act
      • 7.3.8 Reusing predicates
• Part III: Programming
  • 8 Terms
    • 8.1 Relationships
    • 8.2 Structures
    • 8.3 String constants
    • 8.4 Atomic constants
    • 8.5 Numeric constants (Ad)
    • 8.6 Quiz: Terms
  • 9 A simple Prolog program
    • 9.1 Facts and the program database
    • 9.2 Queries
    • 9.3 Goals and subgoals
    • 9.4 Matching
    • 9.5 Variables
    • 9.6 Structures within structures (Ad)
    • 9.7 Summary
    • 9.8 Quiz: A simple Prolog program
  • 10 Matching
    • 10.1 Rules of matching
    • 10.2 Example I
    • 10.3 Example II
    • 10.4 Example III
    • 10.5 Quiz: Matching
  • 11 Rules
    • 11.1 Example of a rule
    • 11.2 Terminology
    • 11.3 Variable scoping rule
    • 11.4 Returning values from rules (Ad)
    • 11.5 Quiz: Rules
  • 12 Prolog's solution strategy (Ad)
    • 12.1 How is a subgoal satisfied? (Ad)
    • 12.2 In what order does matching occur? (Ad)
    • 12.3 What is backtracking? (Ad)
    • 12.4 How are all solutions found? (Ad)
    • 12.5 Summary (Ad)
    • 12.6 Quiz: Prolog's solution strategy (Ad)
  • 13 Recursivity and lists (Ad)
    • 13.1 The definition of a list (Ad)
    • 13.2 Recursive definitions (Ad)
    • 13.3 Recursive predicates (Ad)
    • 13.4 Example of a recursive predicate (Ad)
    • 13.5 Quiz: Recursivity and lists (Ad)
  • 14 Prolog+CG (Ad)
    • 14.1 Relational goals (Ad)
    • 14.2 Logical goals (Ad)
    • 14.3 List goals (Ad)
    • 14.4 Meta-goals (Ad)
    • 14.5 Next (Ad)
• Part IV: Peirce's rules (Ad)
  • 15 Definitions (Ad)
  • 16 Peirce's rules of inference (Ad)
  • 17 Example of usage (Ad)
  • 18 Another example of usage (Ad)
  • 19 Summary (Ad)
  • 20 The end
• Part V: Exercises
  • 21 Syllogisms
    • 21.1 Syllogisms in Prolog: Question
    • 21.2 Syllogisms in Prolog: Answer
  • 22 A Murder Mystery
    • 22.1 Introduction: Question
    • 22.2 Introduction: Answer
    • 22.3 Weapon access: Question
    • 22.4 Weapon access: Answer
    • 22.5 Key access: Question
    • 22.6 Key access: Answer
    • 22.7 Crime access: Question
    • 22.8 Crime access: Answer
    • 22.9 Who is where when: Question
    • 22.10 Who is where when: Answer
    • 22.11 Motive: Question
    • 22.12 Motive: Answer
    • 22.13 Insanity: Question
    • 22.14 Insanity: Answer
    • 22.15 Poverty: Question
    • 22.16 Poverty: Answer
    • 22.17 Jealousy: Question
    • 22.18 Jealousy: Answer
    • 22.19 Being involved with: Question
    • 22.20 Being involved with: Answer
    • 22.21 Relationships: Question
    • 22.22 Relationships: Answer
    • 22.23 The murderer: Question
    • 22.24 The murderer: Answer
  • 23 Blocksworld
    • 23.1 Blocksworld: Question
    • 23.2 Blocksworld: Answer
  • 24 Ontology
    • 24.1 The bat and the weasel: Question
    • 24.2 The bat and the weasel: Answer
  • 25 Formalisation
• Part VI: Reference
  • 26 Glossary
  • 27 References
  • 28 Prolog+CG manual