P-Progol

• Introduction
  • The basic P-Progol algorithm
• Getting started with P-Progol
  • Loading P-Progol
  • Background knowledge file
    • Mode declarations
    • Type specifications
    • Determinations
  • Positive examples file
  • Negative examples file
  • Read all input files
  • Construct a theory
  • Save a theory
  • Evaluate a theory
• Advanced use of P-Progol
  • Setting P-Progol parameters
  • Altering the search
    • Search strategies
    • Evaluation functions
    • Built-in and user-defined pruning
    • User-defined cost specification
    • User-defined constraints
    • User-defined refinement
  • Other commands
• Related versions and programs
  • Yap version of P-Progol
  • Sicstus version of P-Progol
    • Running Sicstus P-Progol
    • How Sicstus Progol Compiles Examples
    • How to Express Constraints in Sicstus Progol
    • No Depth Bound in Sicstus Progol
    • Positive Only Learning in Sicstus Progol
    • No Auto Set of lazy_on_cost in Sicstus Progol
  • SWI version of P-Progol
  • CProgol
  • Indlog
  • T-Reduce
• Reference Manual
  • Change logs
    • Changes in Version 2.7.5
  • Predicates used in P-Progol
• Commands and parameters Index
• Concept Index
• Predicates Index

This document was generated on 29 September 1999 using the texi2html translator version 1.52.