![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
6th LOPSTR 1996: Stockholm, Sweden
- John P. Gallagher:
Logic Programming Synthesis and Transformation, 6th International Workshop, LOPSTR'96, Stockholm, Sweden, August 28-30, 1996, Proceedings. Lecture Notes in Computer Science 1207, Springer 1997, ISBN 3-540-62718-9 - Ian J. Hayes
, R. G. Nickson, Paul A. Strooper:
Refining Specifications to Logic Programs. 1-19 - Laurent Fribourg, Julian Richardson:
Symbolic Verification with Gap-Order Constraints. 20-37 - Agostino Cortesi, Baudouin Le Charlier, Sabina Rossi:
Specification-Based Automatic Verification of Prolog Programs. 38-57 - Michael Leuschel, Danny De Schreye
:
Logic Program Specialisation: How to Be More Specific (Abstract). 58 - Jesper Jørgensen, Michael Leuschel, Bern Martens:
Conjunctive Partial Deduction in Practice. 59-82 - Michael Leuschel, Morten Heine Sørensen:
Redundant Argument Filtering of Logic Programs. 83-103 - Annalisa Bossi, Nicoletta Cocco:
Replacement Can Preserve Termination. 104-129 - Jacob Brunekreef:
A Transformation Tool for Pure Prolog Programs. 130-145 - Alberto Pettorossi, Maurizio Proietti, Sophie Renault:
Enhancing Partial Deduction via Unfold/Fold Rules. 146-168 - Germán Puebla, Manuel V. Hermenegildo:
Abstract Specialization and Its Application to Program Parallelization. 169-186 - Laurent Fribourg, Hans Olsén:
Reductions of Petri Nets and Unfolding of Propositional Logic Programs. 187-203 - Florence Benoy, Andy King:
Inferring Argument Size Relationships with CLP(R). 204-223 - Jonathan C. Martin, Andy King, Paul Soper:
Typed Norms for Typed Logic Programs. 224-238 - Mihhail Matskin, Henryk Jan Komorowski
, John Krogstie
:
Partial Deduction in the Framework of Structural Synthesis of Programs. 239-255 - Timothy S. Gegg-Harrison:
Extensible Logic Program Schemata. 256-274 - Antonio Brogi
, Simone Contiero:
Specialising Meta-level Compositions of Logic Programs. 275-294 - Kung-Kiu Lau, Mario Ornaghi:
Forms of Logic Specifications: A Preliminary Study. 295-312 - Phan Minh Dung, Robert A. Kowalski, Francesca Toni:
Synthesis of Proof Procedures for Default Reasoning. 313-324
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.