A Formal Model of Pure Prolog Execution

Title: A Formal Model of Pure Prolog Execution

Research Question: How can we create a formal model that accurately represents the execution of pure Prolog?

Methodology: The authors created a formal model called S:PP that combines the intuition of ports with a compact representation of execution state. They used a mathematical definition to define the 4-port model for pure Prolog execution. This model allows for both forward and backward derivation steps.

Results: The authors presented a formal definition of ports and port transitions. They also provided a restriction on the program, requiring it to be pure and transformed into a canonical form. This resulted in a single-clausal representation, which is used in logic program analysis.

Implications: The S:PP model satisfies a modularity claim, making it suitable for formal reasoning. This model provides a clear understanding of the execution process in pure Prolog, which can be beneficial for debugging and writing more efficient programs. It also opens up possibilities for further research in this area.

In conclusion, the S:PP model is a significant contribution to the understanding of pure Prolog execution. It provides a formal and compact representation of the execution state, making it suitable for further research and formal reasoning.

Link to Article: https://arxiv.org/abs/0310020v1 Authors: arXiv ID: 0310020v1