Conferences in DBLP

International Workshop on Logic Program Synthesis and Transformation (LOPSTR) (lopstr)
1992 (conf/lopstr/92)

1. Ina Kraan, David A. Basin, Alan Bundy
   Logic Program Synthesis via Proof Planning. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:1-14 [Conf]
   
2. Daniele Nardi, Riccardo Rosati
   Deductive Synthesis of Programs for Query Answering. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:15-29 [Conf]
   
3. Carlos Loría-Sáenz
   Synthesis of Narrowing Programs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:30-45 [Conf]
   
4. Laurent Fribourg, Hans Olsén
   A Unifying View of Structural Induction and Computation Induction for Logic Programs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:46-60 [Conf]
   
5. Mario Ornaghi
   Proof Nets. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:61-79 [Conf]
   
6. Gerd Neugebauer
   The LOPS Approach: A Transformational Point of View (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:80-81 [Conf]
   
7. Maurizio Proietti, Alberto Pettorossi
   Best-first Strategies for Incremental Transformations of Logic Programs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:82-98 [Conf]
   
8. Dmitri Boulanger, Maurice Bruynooghe
   Deriving Transformations for Logic Programs Using Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:99-117 [Conf]
   
9. Evelina Lamma, Paola Mello
   A Rationalisation of the ATMS in Terms of Partial Evaluation. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1992, pp:118-131 [Conf]
   
10. Giuseppe De Giacomo
    Intensional Query Answering: An Application of Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:132-150 [Conf]
    
11. John P. Gallagher, D. Andre de Waal
    Deletion of Redundant Unary Type Predicates from Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:151-167 [Conf]
    
12. Kristof Verschaetse, Stefaan Decorte, Danny De Schreye
    Automatic Termination Analysis. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:168-183 [Conf]
    
13. John Jones
    Applications of Unfolding in Prolog Programming. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:184-198 [Conf]
    
14. Steven David Prestwich
    An Unfold Rule for Full Prolog. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:199-213 [Conf]
    
15. Torben Æ. Mogensen, Anders Bondorf
    Logimix: A Self-Applicable Partial Evaluator for Prolog. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:214-227 [Conf]
    
16. Anne Parrain, Philippe Devienne, Patrick Lebègue
    Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:228-241 [Conf]
    
17. Bart Demoen
    On the Transformation of a Prolog Program to a More Efficient Binary Program. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:242-252 [Conf]
    
18. José André Jimènez-Martin, Julio Moriño-Carballo, Juan José Moreno-Navarro
    Efficient Compilation of Lazy Narrowing into Prolog. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:253-270 [Conf]