Abstract. In this paper, we develop a bottom-up xed point semantics for pure Prolog programs extended with!/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order in which solutions are computed by SLD-resolution and their multiplicity. 1
|
1677
|
Foundations of Logic Programming
– Lloyd
- 1987
|
|
625
|
The semantics of predicate logic as a programming language
– Emden, Kowalski
- 1976
|
|
567
|
Partial Evaluation and Automatic Program Generation
– Jones, Gomard, et al.
- 1993
|
|
397
|
Introduction to Logic Programming
– Apt
- 1988
|
|
115
|
The s-semantics approach: Theory and applications
– Bossi, Gabbrielli, et al.
- 1994
|
|
96
|
Mixtus: An automatic partial evaluator for full Prolog
– Sahlin
- 1993
|
|
75
|
A Compositional Semantics for Logic Programs
– Bossi, Gabbrielli, et al.
- 1994
|
|
71
|
A general framework for semantics-based bottom-up abstract interpretation of logic programs. ACM Transactions on Programming Languages and Systems
– Barbuti, Giacobazzi, et al.
- 1993
|
|
58
|
Bottom-up Abstract Interpretation of Logic Programs
– Codish, Dams, et al.
- 1990
|
|
55
|
Denotational and operational semantics for Prolog
– Debray, Mishra
- 1988
|
|
35
|
Schreye. Logic program specialisation: How to be more specific
– Leuschel, De
- 1996
|
|
29
|
Modelling Prolog Control
– Barbuti, Codish, et al.
- 1992
|
|
27
|
Program specialisation and abstract interpretation reconciled
– Leuschel
- 1998
|
|
20
|
Semantics preserving transformation rules for Prolog
– Proietti, Pettorossi
- 1991
|
|
16
|
Partial evaluation of the “real thing
– Leuschel
- 1994
|
|
11
|
An unfold rule for full Prolog
– Prestwich
- 1992
|
|
10
|
Theories for mutagenicity: A study in and feature-based induction
– Srinivasan, Muggleton, et al.
- 1996
|
|
9
|
Compositionality properties of SLD-derivations
– Comini, Meo
- 1999
|
|
9
|
On the treatment of cuts in Prolog source-level tools
– O'Keefe
- 1985
|
|
8
|
Most speci logic programs
– Marriott, Naish, et al.
- 1988
|
|
7
|
Partial evaluation in Prolog: Some improvements about cut
– Bugliesi, Russo
- 1989
|
|
6
|
Sequence-Based Abstract Interpretation of Prolog
– Charlier, Rossi, et al.
- 1997
|
|
6
|
Static analysis of Prolog with cut
– File, Rossi
- 1993
|
|
5
|
Proving termination of Prolog programs: A semantic approach
– Baudinet
- 1992
|
|
5
|
Declarative modeling of the operational behaviour of logic programs
– Falaschi, Levi, et al.
- 1989
|
|
5
|
Operational and goal-independent denotational semantics for Prolog with cut
– Spoto
- 2000
|
|
4
|
A framework for bottom up specialisation of logic programs
– Vanhoof, Schreye, et al.
- 1998
|
|
3
|
Bottom-up partial deduction of logic programs
– Vanhoof, Schreye, et al.
- 1999
|
|
