SICStus Prolog

SICStus Prolog
Introduction
Acknowledgments
1 Notational Conventions
- 1.1 Keyboard Characters
- 1.2 Mode Spec
- 1.3 Development and Runtime Systems
- 1.4 Function Prototypes
- 1.5 ISO Compliance
2 Glossary
3 How to Run Prolog
- 3.1 Getting Started
  - 3.1.1 Environment Variables
- 3.2 Reading in Programs
- 3.3 Inserting Clauses at the Terminal
- 3.4 Queries and Directives
  - 3.4.1 Queries
  - 3.4.2 Directives
- 3.5 Syntax Errors
- 3.6 Undefined Predicates
- 3.7 Program Execution And Interruption
- 3.8 Exiting From The Top-Level
- 3.9 Nested Executions—Break
- 3.10 Saving and Restoring Program States
- 3.11 Emacs Interface
4 The Prolog Language
- 4.1 Syntax, Terminology and Informal Semantics
  - 4.1.1 Terms
  - 4.1.2 Programs
- 4.2 Declarative Semantics
- 4.3 Procedural Semantics
- 4.4 Occurs-Check
- 4.5 The Cut Symbol
- 4.6 Operators
- 4.7 Syntax Restrictions
- 4.8 Comments
5 The Module System
- 5.1 Basic Concepts
- 5.2 Module Prefixing
- 5.3 Defining Modules
- 5.4 Importation
- 5.5 Module Name Expansion
- 5.6 Meta-Predicate Declarations
6 Loading Programs
- 6.1 Predicates that Load Code
- 6.2 Declarations
- 6.3 Initializations
- 6.4 Considerations for File-To-File Compilation
7 Debugging
- 7.1 The Procedure Box Control Flow Model
- 7.2 Basic Debugging Predicates
- 7.3 Plain Spypoints
- 7.4 Format of Debugging Messages
- 7.5 Commands Available during Debugging
- 7.6 Advanced Debugging — an Introduction
- 7.7 Breakpoint Handling Predicates
- 7.8 The Processing of Breakpoints
- 7.9 Breakpoint Conditions
- 7.10 Consulting during Debugging
- 7.11 Catching Exceptions
8 Built-In Predicates
- 8.1 Input / Output
- 8.2 Arithmetic
- 8.3 Comparison of Terms
- 8.4 Control
- 8.5 Error and Exception Handling
- 8.6 Information about the State of the Program
- 8.7 Meta-Logic
- 8.8 Modification of Terms
- 8.9 Modification of the Program
- 8.10 Internal Database
- 8.11 Blackboard Primitives
- 8.12 All Solutions
- 8.13 Messages and Queries
- 8.14 Coroutining
- 8.15 Debugging
- 8.16 Execution Profiling
- 8.17 Miscellaneous
9 Mixing C/C++ and Prolog
- 9.1 Notes
- 9.2 Calling C from Prolog
- 9.3 Calling C++ from Prolog
- 9.4 Support Functions
- 9.5 Calling Prolog from C
- 9.6 SICStus Streams
- 9.7 Hooks
- 9.8 Stand-alone Executables
- 9.9 Examples
10 Interfacing .NET and Java
11 Multiple SICStus Run-Times in a Process
- 11.1 Memory Considerations
- 11.2 Multiple SICStus Run-Times in Java
- 11.3 Multiple SICStus Run-Times in C
  - 11.3.1 Using a Single SICStus Run-Time
  - 11.3.2 Using More than One SICStus Run-Time
- 11.4 Foreign Resources and Multiple SICStus Run-Times
  - 11.4.1 Foreign Resources Supporting Only One SICStus Run-Time
  - 11.4.2 Foreign Resources Supporting Multiple SICStus Run-Times
    - 11.4.2.1 Simplified Support for Multiple SICStus Run-Times
    - 11.4.2.2 Full Support for Multiple SICStus Run-Times
- 11.5 Multiple Run-Times and Threads
12 Handling Wide Characters
- 12.1 Introduction
- 12.2 Concepts
- 12.3 Summary of Prolog Level WCX features
- 12.4 Selecting the WCX Mode Using Environment Variables
- 12.5 Selecting the WCX Mode Using Hooks
- 12.6 Summary of WCX Features in the Foreign Interface
- 12.7 Summary of Wcx-Related Features in the Libraries
- 12.8 WCX Related Utility Functions
- 12.9 Representation of EUC Wide Characters
- 12.10 A Sample Wide Character Extension (WCX) Box
13 Writing Efficient Programs
- 13.1 Overview
- 13.2 The Cut
- 13.3 Indexing
- 13.4 Last Clause Determinacy Detection
- 13.5 The Determinacy Checker
- 13.6 Last Call Optimization
  - 13.6.1 Accumulating Parameters
  - 13.6.2 Accumulating Lists
- 13.7 Building and Dismantling Terms
- 13.8 Conditionals and Disjunction
- 13.9 Programming Examples
- 13.10 The Cross-Referencer
14 The SICStus Tools
15 The Prolog Library
16 Array Operations
17 Association Lists
18 Attributed Variables
19 Heap Operations
20 List Operations
21 Term Utilities
22 Ordered Set Operations
23 Queue Operations
24 Random Number Generator
25 Operating System Utilities
26 Updatable Binary Trees
27 Unweighted Graph Operations
28 Weighted Graph Operations
29 Socket I/O
30 Linda—Process Communication
- 30.1 Server
- 30.2 Client
31 External Storage of Terms (Berkeley DB)
- 31.1 Basics
- 31.2 Current Limitations
- 31.3 Berkeley DB
- 31.4 The DB-Spec—Informal Description
- 31.5 Predicates
- 31.6 An Example Session
- 31.7 The DB-Spec
- 31.8 Exporting and importing a database
32 Boolean Constraint Solver
- 32.1 Solver Interface
- 32.2 Examples
33 Constraint Logic Programming over Rationals or Reals
- 33.1 Introduction
  - 33.1.1 Referencing this Software
  - 33.1.2 Acknowledgments
- 33.2 Solver Interface
- 33.3 Linearity and Nonlinear Residues
  - 33.3.1 How Nonlinear Residues Are Made to Disappear
  - 33.3.2 Isolation Axioms
- 33.4 Numerical Precision and Rationals
- 33.5 Projection and Redundancy Elimination
- 33.6 Why Disequations
- 33.7 Syntactic Sugar
  - 33.7.1 Monash Examples
    - 33.7.1.1 Compatibility Notes
- 33.8 A Mixed Integer Linear Optimization Example
- 33.9 Implementation Architecture
  - 33.9.1 Fragments and Bits
  - 33.9.2 Bugs
34 Constraint Logic Programming over Finite Domains
- 34.1 Introduction
  - 34.1.1 Referencing this Software
  - 34.1.2 Acknowledgments
- 34.2 Solver Interface
- 34.3 Available Constraints
- 34.4 Enumeration Predicates
- 34.5 Statistics Predicates
- 34.6 Answer Constraints
- 34.7 The Constraint System
  - 34.7.1 Definitions
  - 34.7.2 Pitfalls of Interval Reasoning
- 34.8 Defining Global Constraints
- 34.9 Defining Primitive Constraints
- 34.10 Example Programs
- 34.11 Syntax Summary
35 Constraint Handling Rules
- 35.1 Copyright
- 35.2 Introduction
- 35.3 Introductory Examples
- 35.4 CHR Library
- 35.5 Debugging CHR Programs
- 35.6 Programming Hints
- 35.7 Constraint Handlers
- 35.8 Backward Compatibility
36 Finite Domain Constraint Debugger
- 36.1 Introduction
- 36.2 Concepts
- 36.3 Basics
- 36.4 Advanced Usage
37 SICStus Objects
- 37.1 Getting Started
- 37.2 Declared Objects
- 37.3 Self, Message Sending, and Message Delegation
- 37.4 Object Hierarchies, Inheritance, and Modules
- 37.5 Creating Objects Dynamically
- 37.6 Access Driven Programming—Daemons
- 37.7 Instances
- 37.8 Built-In Objects and Methods
- 37.9 Expansion to Prolog Code
- 37.10 Examples
38 The PiLLoW Web Programming Library
39 Parsing and Generating XML
40 Tcl/Tk Interface
- 40.1 Introduction
- 40.2 Tcl
- 40.3 Tk
- 40.4 The Tcl/Tk Prolog Library
- 40.5 Putting It All Together
- 40.6 Quick Reference
- 40.7 Resources
41 The Gauge Profiling Tool
42 I/O on Lists of Character Codes
43 Jasper Java Interface
- 43.1 Jasper Overview
- 43.2 Getting Started
- 43.3 Calling Prolog from Java
- 43.4 Jasper Package Class Reference
- 43.5 Java Exception Handling
- 43.6 SPTerm and Memory
  - 43.6.1 Lifetime of SPTerms and Prolog Memory
  - 43.6.2 Preventing SPTerm Memory Leaks
- 43.7 Java Threads
- 43.8 The Jasper Library
44 PrologBeans Interface
- 44.1 Introduction
- 44.2 Features
- 44.3 A First Example
- 44.4 Prolog Server Interface
- 44.5 Java Client Interface
- 44.6 Java Examples
- 44.7 .NET Client Interface
- 44.8 .NET Examples
  - 44.8.1 C# Examples
    - 44.8.1.1 .NET Embedding
    - 44.8.1.2 ASPX Servers Pages
  - 44.8.2 Visual Basic Example
45 COM Client
- 45.1 Preliminaries
- 45.2 Terminology
- 45.3 Predicate Reference
- 45.4 Examples
46 The Visual Basic Interface
- 46.1 Overview
- 46.2 How to Call Prolog from Visual Basic
- 46.3 How to Use the Interface
- 46.4 Examples
- 46.5 Summary of the Interface Functions
47 Glue Code Generator
48 Meta-Call with Limit on Memory Use
49 Meta-Call with Timeout
50 Summary of Built-In Predicates
51 Full Prolog Syntax
- 51.1 Notation
- 51.2 Syntax of Sentences as Terms
- 51.3 Syntax of Terms as Tokens
- 51.4 Syntax of Tokens as Character Strings
  - 51.4.1 iso Execution Mode Rules
  - 51.4.2 sicstus Execution Mode Rules
- 51.5 Escape Sequences
- 51.6 Notes
52 Standard Operators
References
Predicate Index
SICStus Objects Method Index
Keystroke Index
Book Index

Prolog is a simple but powerful programming language developed at the University of Marseille, as a practical tool for programming in logic. From a user's point of view the major attraction of the language is ease of programming. Clear, readable, concise programs can be written quickly with few errors.

SICStus Prolog

Table of Contents

SICStus Prolog