(Enter summary)
Abstract: In this paper we study some first order formulas, called resultants, which can be used to
describe in a concise way most of the relevant information associated to SLD-derivations. We
first extend to resultants some classical results of logic programming theory. Then we define
a fixpoint semantics for Prolog computed resultants, i.e. those formulas which are obtained
by considering the leftmost selection rule. Suitable abstractions of such a semantics are then
used to model call patterns and... (Update)
Context of citations to this paper: More
.... Computed answers were considered in [6, 7] call patterns and partial answers were considered in [11] and resultants were considered in [10] (see [2] for a survey of the approach) Moreover, a framework where one can define denotations modeling various observables (thus...
.... OR compositional correct answers [28] OR compositional computed answers [6] call patterns [27] proof trees [33, 34] and resultants [26]. In addition there are several semantics specifically designed for static program analysis, which can handle various observables such as...
Cited by: More
Watchpoint Semantics: A Tool for Compositional and Focussed Static .. - Spoto (2001)
(Correct)
Finite Failure is and-Compositional - Gori, Levi (1997)
(Correct)
Functional Compositions of Abstract Interpretations - Giacobazzi, al.
(Correct)
Active bibliography (related documents): More All
0.5: Observable Behaviors and Equivalences of Logic Programs - Gabbrielli, Levi, Meo (1992)
(Correct)
0.5: S-Semantics Approach: Theory And Applications - Bossi, Gabbrielli, Levi.. (1994)
(Correct)
0.3: Analysis of pure PROLOG programs - Levi, Micciancio (1995)
(Correct)
Similar documents based on text: More All
0.5: A compositional Semantics for CHR - Maurizio Gabbrielli And
(Correct)
0.4: A Theory of Observables for Logic Programs - Comini, Levi, Meo (1996)
(Correct)
0.3: Observational Equivalences for Logic Programs - Gabbrielli, Levi, Meo (1992)
(Correct)
Related documents from co-citation: More All
5: Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
5: Declarative modeling of the operational behavior of logic languages (context) - Falaschi, Levi et al. - 1989
5: Introduction to logic programming (context) - Apt - 1990
BibTeX entry: (Update)
M. Gabbrielli, G. Levi, and M. C. Meo. Resultants semantics for PROLOG. Journal of Logic and Computation, 6(4):491--521, 1996. http://citeseer.ist.psu.edu/21434.html More
@article{ gabbrielli96resultants,
author = "Maurizio Gabbrielli and Giorgio Levi and Maria Chiara Meo",
title = "Resultants Semantics for Prolog",
journal = "Journal of Logic and Computation",
volume = "6",
number = "4",
pages = "491-521",
year = "1996",
url = "citeseer.ist.psu.edu/21434.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987 ACM
224
Partial Evaluation in Logic Programming (context) - Lloyd, Shepherdson - 1991
181
Mathematical Logic (context) - Shoenfield - 1967
166
Unification Revisited (context) - Lassez, Maher et al. - 1988
146
Introduction to Logic Programming (context) - Apt - 1990 ACM DBLP
139
Fold Transformations of Logic Programs (context) - Tamaki, Sato - 1984
128
Declarative Modeling of the Operational Behavior of Logic La.. (context) - Falaschi, Levi et al. - 1989 ACM DBLP
78
Predicate logic as a computational formalism (context) - Clark - 1979
66
Recursive query processing: the power of logic (context) - Vieille - 1989
57
A Compositional Semantics for Logic Programs (context) - Bossi, Gabbrielli et al. - 1994 ACM DBLP
42
Fully abstract compositional semantics for logic programs (context) - Gaifman, Shapiro - 1989 ACM DBLP
40
Algebraic properties of idempotent substitutions
- Palamidessi - 1990 ACM DBLP
32
Properties of substitutions and unifications (context) - Eder - 1985
30
A Specification of an Abstract Prolog Machine and Its Applic.. (context) - Komorowski - 1981
25
Fixpoint Semantics for Partial Computed Answer Substitutions.. (context) - Gabbrielli, Meo - 1992 ACM DBLP
23
An analysis of loop checking mechanisms for logic programs (context) - Bol, Apt et al. - 1991 ACM DBLP
18
An Algebraic theory of observables
- Comini, Levi - 1994 ACM DBLP
15
Observational Equivalences for Logic Programs
- Gabbrielli, Levi et al. - 1992
14
Oracle Semantics for PROLOG
- Barbuti, Codish et al. - 1992 ACM DBLP
9
Fixpoint semantics for PROLOG (context) - Bossi, Bugliesi et al. - 1993
7
Dipartimento di Informatica (context) - Bossi, Gabbrielli et al. - 1993
6
Modular Transformations of CLP Programs (context) - Etalle, Gabbrielli - 1994
5
Formal bases for dataflow analysis of logic programs (context) - Debray - 1994 ACM
1
G'erard Ferrand and Jean-Hugues R'ety (context) - Bergere - 1993
1
Observable Behaviours and Equivalences of Logic Programs (context) - Gabbrielli, Levi et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://strudel.di.unipi.it/papers/): More
Properties of the Lattice of Observables in Logic Programming - Amato, Levi (1997)
(Correct)
A Reactive Implementation of Pos Using ROBDDs - Bagnara (1996)
(Correct)
An OR-Compositional Semantics for Logic Programs - Bossi, GABBRIELLI, LEVI, MEO (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC