Foundations of logic programming
Foundations of logic programming
Properties of substitutions and unifications
Journal of Symbolic Computation
Operational and denotational semantics of prolog
Journal of Logic Programming
A denotational semantics for Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple operational and denotational semantics for Prolog with cut
Theoretical Computer Science - Special issue on the Second French-Soviet Workshop on Methods of Compilation and Program Construction, Nice, France, Feb. 1988
Comparative semantics for PROLOG with cut
Science of Computer Programming
Logic programming: operational semantics and proof theory
Logic programming: operational semantics and proof theory
Proving termination properties of Prolog programs: a semantic approach
Journal of Logic Programming
An operational formal definition of PROLOG: a specification method and its application
New Generation Computing
Compositional operational semantics for Prolog programs
New Generation Computing
A continuation-passing style for prolog
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A mathematical definition of full Prolog
Science of Computer Programming
Prolog: the standard: reference manual
Prolog: the standard: reference manual
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Axiomatizations of Backtracking
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
What's in a Trace: The Box Model Revisited
AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
The witness properties and the semantics of the Prolog cut
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
This article proposes a new mathematical definition of the execution of pure Prolog, in the form of axioms in a structural operational semantics. The main advantage of the model is its ease in representing backtracking, due to the functionality of the transition relation and its converse. Thus, forward and backward derivation steps are possible. A novel concept of stages is introduced, as a refinement of final states, which captures the evolution of a backtracking computation. An advantage over the traditional stack-of-stacks approaches is a modularity property. Finally, the model combines the intuition of the traditional 'Byrd box' metaphor with a compact representation of execution state, making it feasible to formulate and prove theorems about the model. In this paper we introduce the model and state some useful properties.