Logic program synthesis and transformation : 5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995 : proceedings /

Gorde:
Xehetasun bibliografikoak
Erakunde egilea: International Workshop on Logic Program Synthesis and Transformation Utrecht, Netherlands
Beste egile batzuk: Proietti, Maurizio, 1959-
Formatua: Conference Proceeding Liburua
Hizkuntza:English
Argitaratua: Berlin ; New York : Springer, c1996.
Saila:Lecture notes in computer science ; 1048.
Gaiak:
Aurkibidea:
  • Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints / Michael Leuschel
  • Memoing Evaluation by Source-to-Source Transformation / Jens E. Wunderwald
  • Transformation of Left Terminating Programs: The Reordering Problem / Annalisa Bossi, Nicoletta Cocco and Sandro Etalle
  • Derivation of Concurrent Algorithms in Tempo / Steve Gregory
  • An Argumentation-Theoretic Approach to Logic Program Transformation / Francesca Toni and Robert A. Kowalski
  • Complexity of Horn Programs / Erik Aarts
  • Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis / M. M. Gallardo and J. M. Troya
  • Towards Automatic Control for CLP(x) Programs / Fred Mesnard
  • Ideal Refinement of Datalog Programs / Giovanni Semeraro, Floriana Esposito and Donato Malerba
  • Guiding Program Development Systems by a Connection Based Proof Strategy / Cristoph Kreitz, Jens Otten and Stephan Schmitt.
  • Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs / Kung-Kiu Lau and Mario Ornaghi
  • Logic Program Synthesis by Induction over Horn Clauses / Andrew J. Parkes and Geraint A. Wiggins
  • Logic Program Transformation Through Generalization Schemata / Pierre Flener and Yves Deville
  • An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced Schema-Based Transformations / Wamberto W. Vasconcelos and Norbert E. Fuchs
  • Solving Deductive Planning Problems Using Program Analysis and Transformation / D. A. de Waal and M. Thielscher
  • Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs Under the Completion / Sophie Renault
  • Termination of Logic Programs Using Semantic Unification / Thomas Arts and Hans Zantema
  • On the Mechanics of Metasystem Hierarchies in Program Transformation.