Conferences in DBLP

International Workshop on Logic Program Synthesis and Transformation (LOPSTR) (lopstr)
1993 (conf/lopstr/93)

1. Douglas R. Smith
   Towards the Synthesis of Constraint Propagation Algorithms. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:1-9 [Conf]
   
2. Kung-Kiu Lau, Mario Ornaghi
   A Formal View of Specification, Deductive Synthesis and Transformation of Logic Programs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:10-31 [Conf]
   
3. Gerd Neugebauer
   Reachability Analysis for the Extension Procedure - A Topological Result. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:32-44 [Conf]
   
4. Francesco Bergadano, Daniele Gunetti
   Inductive Synthesis of Logic Programs and Inductive Logic Programming. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:45-56 [Conf]
   
5. Marko Grobelnik
   Induction of Prolog Programs with Markus. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:57-63 [Conf]
   
6. Peter Madden, Jane Hesketh, Ian Green, Alan Bundy
   A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (Abstract). [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:64-66 [Conf]
   
7. Vincent Lombart, Geraint A. Wiggins, Yves Deville
   Guiding Synthesis Proofs. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:67-81 [Conf]
   
8. Maria Vargas-Vera, David Stuart Robertson, Robert Inder
   Combining Prolog Programs in a Techniques Editing System (Abstract). [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:82-84 [Conf]
   
9. Wamberto Weber Vasconcelos
   Designing Prolog Programming Techniques. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 1993, pp:85-99 [Conf]
   
10. Anna-Lena Johansson
    Interactive Program Derivation Using Program Schemata and Incrementally Generated Strategies. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:100-112 [Conf]
    
11. D. Andre de Waal
    The Power of Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:113-123 [Conf]
    
12. Corin A. Gurr
    Specialising the Ground Representation in the Logic Programming Language Gödel. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:124-140 [Conf]
    
13. Maurizio Proietti, Alberto Pettorossi
    Synthesis of Programs from Unfold/Fold Proofs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:141-158 [Conf]
    
14. Bern Martens, Danny De Schreye
    Some Further Issues in Finite Unfolding (Abstract). [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:159-161 [Conf]
    
15. Ulrich Neumerkel
    A Transformation Based in the Equality Between Terms. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:162-176 [Conf]
    
16. M. Olmedilla, Francisco Bueno, Manuel V. Hermenegildo
    Automatic Exploitation of Non-Determinate Independent And-Parallelism in the Basic Andorra Model. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:177-195 [Conf]
    
17. Paul Tarau, Koenraad De Bosschere
    Memoing with Abstract Answers and Delphi Lemmas. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:196-209 [Conf]
    
18. Dmitri Boulanger, Maurice Bruynooghe
    Using Abstract Interpretation for Goal Replacement. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:210-228 [Conf]
    
19. Pierre De Boeck, Baudouin Le Charlier
    Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:229-245 [Conf]