Pure Prolog Execution in 21 Rules
Programming Languages
2007-05-23 v1 Logic in Computer Science
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.
Cite
@article{arxiv.cs/0310020,
title = {Pure Prolog Execution in 21 Rules},
author = {Marija Kulas},
journal= {arXiv preprint arXiv:cs/0310020},
year = {2007}
}
Comments
15 pages. Appeared in Proc. of the 5th Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP'03), within CP'03, Kinsale, September 2003