Pure Prolog Execution in 21 Rules

TL;DR

This paper introduces a mathematical 4-port model for pure Prolog execution, enabling formal reasoning through a modular and compact representation of execution states with forward and backward derivation capabilities.

Contribution

It presents a novel 4-port model that formalizes pure Prolog execution, combining ports with a compact state representation for improved reasoning.

Findings

Model supports forward and backward derivation steps

Satisfies modularity for formal reasoning

Provides a compact, intuitive execution state representation

Abstract

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.