E. Villemonte de la Clergerie  Home/Search
Context Related
| inria.fr/INRIA/Projects/A...POPL93.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pauillac.inria.fr/a...publioscope (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present in this paper a structure--sharing framework originally developed for a Dynamic Programming interpreter of Logic Programs called DyALog. This mechanism should be of interest for alternative execution models of PROLOG which maintain multiple computation branches and reuse sub--computations in various contexts (computation sharing). This category includes, besides our Dynamic Programming model, the tabular models (OLDT, SLDAL, XWAM), the "magicset " models, and the independent AND and... (Update)
Context of citations to this paper: More
...in the WAM to manage variable bindings with dereferencing. However, in our case, our environments are used to achieve StructureSharing [VdlC93a] and, this way, save space. 2. Any DOB present in the agenda will be selected (fair ness of the selection) Now, let us describe an...
.... large sets of non ground atoms, and (3) structure sharing techniques to reduce the tabulation costs, as well as speed up subsumption [VdlC93b, SR93]. 4 Logic Push Down Automata 4.1 History The approach presented here takes its roots in the work on context free (CF) parsing....
Cited by: More
Information flow in tabular interpretations for.. - Clergerie.. (1997) (Correct)
Efficient Access Mechanisms For Tabled Logic Programs - Ramakrishnan, Rao.. (1999) (Correct)
LPDA: Another look at Tabulation in Logic Programming - Clergerie, Lang (1994) (Correct)
Active bibliography (related documents): More All
0.6: Subsumption-oriented Push-Down Automata - Barthélemy, Clergerie (Correct)
0.4: Slr Inference: An Inference System For Fixed-Mode Logic.. - Rosenblueth, Peralta (Correct)
0.3: The Structure of Shared Forests in Ambiguous Parsing - Billot, Lang (1989) (Correct)
Similar documents based on text: More All
0.3: Practical aspects in compiling tabular TAG parsers - Alonso, Seddah, Clergerie (2000) (Correct)
0.2: How to build quickly an efficient implementation of the .. - Lefèbvre.. (Correct)
0.1: Shared Forests Can Guide Parsing - Barthelemy, Boullier, Deschamp.. (Correct)
Related documents from co-citation: More All
3: Complete evaluation of Horn Clauses, an automata theoretic approach (context) - Lang - 1988
3: Subsumption--oriented Push-- Down Automata (context) - Barth'elemy, de la - 1992
3: a Piles et Programmation Dynamique. DyALog : Une Application `a la Programmation.. (context) - Clergerie, Automates - 1993
BibTeX entry: (Update)
Eric Villemonte de la Clergerie. Layer Sharing : an improved structure--sharing framework. In Proc. of POPL'93, pages 345--356, 1993. http://citeseer.ist.psu.edu/villemontedelaclerge93layer.html More
@inproceedings{ clergerie93layer,
author = "E. Villemonte de la Clergerie",
title = "Layer Sharing: An Improved Structure-Sharing Framework",
booktitle = "Conference Record of the Twentieth Annual {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages",
address = "Charleston, South Carolina",
pages = "345--358",
year = "1993",
url = "citeseer.ist.psu.edu/villemontedelaclerge93layer.html" }
Citations (may not include all citations):233 Natural semantics (context) - Kahn - 1987
204 Magic--set and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
112 OLD resolution with tabulation (context) - Tamaki, Sato - 1986
83 Prolog and its performance: Exploiting independent And-Paral.. (context) - Hermenegildo, Greene
68 Confluence properties of weak and strong calculi of explicit.. - Curien, Hardin et al. - 1992
43 the power of alexander templates (context) - Seki - 1989
30 The sharing of structure in theorem--proving programs (context) - Boyer, Moore - 1972
25 A structure-- sharing representation for unification-- based.. - Pereira - 1985
19 Efficient prolog memory management for flexible control stra.. (context) - Warren - 1984
17 A simulation study of Or-- and independent And--parallelism (context) - Shen, Hermenegildo - 1991
17 Database-complete proof procedures based on SLD resolution (context) - Vieille - 1987
13 Complete evaluation of Horn clauses: an automata theoretic a.. (context) - Lang - 1988
12 On criteria for Or--parallel execution models of logic progr.. (context) - Gupta, Jayaraman - 1990
7 IDIOM: Integrating dependent And (context) - Gupta, Costa et al. - 1991
6 The SRI model for OR-- parallel execution of prolog (context) - Warren - 1987
6 Subsumption--oriented push-- down automata (context) - Barth'elemy, de la - 1992
5 Optimal Interpreters for Lambda--calculus Based Functional L.. (context) - Kathail - 1990
3 A bottom-- up parser based on predicate logic: A survey of t.. (context) - Uehara, Ochitani et al. - 1984
2 DyALog: une implantation des clauses de horn en programmatio.. (context) - de la
1 Restricted AND--parallism (context) - DeGroot - 1984
Documents on the same site (http://pauillac.inria.fr/atoll/publioscope.html): More
A Tabular Interpretation of Bottom-up Automata for TAG - Clergerie, Pardo, Souto (1998) (Correct)
How to build quickly an efficient implementation of the .. - Lefèbvre.. (Correct)
Garbage Collecting the World - Lang, Queinnec, Piquer (1992) (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