Pure Prolog Execution in 21 Rules
Abstract
Description
A simple mathematical definition of the 4-port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable for formal reasoning.
15 pages. Appeared in Proc. of the 5th Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP'03), within CP'03, Kinsale, September 2003
15 pages. Appeared in Proc. of the 5th Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP'03), within CP'03, Kinsale, September 2003