default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th LOPSTR 1995: Utrecht, The Netherlands
- Maurizio Proietti:
Logic Programming Synthesis and Transformation, 5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995, Proceedings. Lecture Notes in Computer Science 1048, Springer 1996, ISBN 3-540-60939-3 - Michael Leuschel:
Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints. 1-16 - Jens E. Wunderwald:
Memoing Evaluation by Source-to-Source Transformation. 17-32 - Annalisa Bossi, Nicoletta Cocco, Sandro Etalle:
Transformation of Left Terminating Programs: the Reordering Problem. 33-45 - Steve Gregory:
Derivation of Concurrent Algorithms in Tempo. 46-60 - Francesca Toni, Robert A. Kowalski:
An Argumentation-Theoretic Approach to Logic Program Transformation. 61-75 - Erik Aarts:
Complexity of Horn Programs. 76-90 - María-del-Mar Gallardo, José M. Troya:
Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis. 91-105 - Frédéric Mesnard:
Towards Automatic Control for CLP(x) Programs. 106-119 - Giovanni Semeraro, Floriana Esposito, Donato Malerba:
Ideal Refinement of Datalog Programs. 120-136 - Christoph Kreitz, Jens Otten
, Stephan Schmitt:
Guiding Program Development Systems by a Connection Based Proof Strategy. 137-151 - Kung-Kiu Lau, Mario Ornaghi:
Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs. 152-169 - Andrew J. Parkes, Geraint A. Wiggins:
Logic Program Synthesis by Induction over Horn Clauses. 170 - Pierre Flener, Yves Deville:
Logic Program Transformation through Generalization Schemata. 171-173 - Wamberto Weber Vasconcelos, Norbert E. Fuchs:
An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced Schema-Based Transformations. 174-188 - D. Andre de Waal, Michael Thielscher:
Solving Deductive Planning Problems Using Program Analysis and Transformation. 189-203 - Sophie Renault:
Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion. 204-218 - Thomas Arts, Hans Zantema:
Termination of Logic Programs Using Semantic Unification. 219-233 - Robert Glück:
On the Mechanics of Metasystem Hierarchies in Program Transformation. 234-251 - Michael Hanus:
Efficient Translation of Lazy Functional Logic Programs into Prolog. 252-266
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-29 01:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
