|
Conferences in DBLP
- Ian J. Hayes, R. G. Nickson, Paul A. Strooper
Refining Specifications to Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:1-19 [Conf]
- Laurent Fribourg, Julian Richardson
Symbolic Verification with Gap-Order Constraints. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:20-37 [Conf]
- Agostino Cortesi, Baudouin Le Charlier, Sabina Rossi
Specification-Based Automatic Verification of Prolog Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:38-57 [Conf]
- Michael Leuschel, Danny De Schreye
Logic Program Specialisation: How to Be More Specific (Abstract). [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:58- [Conf]
- Jesper Jørgensen, Michael Leuschel, Bern Martens
Conjunctive Partial Deduction in Practice. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:59-82 [Conf]
- Michael Leuschel, Morten Heine Sørensen
Redundant Argument Filtering of Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:83-103 [Conf]
- Annalisa Bossi, Nicoletta Cocco
Replacement Can Preserve Termination. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:104-129 [Conf]
- Jacob Brunekreef
A Transformation Tool for Pure Prolog Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:130-145 [Conf]
- Alberto Pettorossi, Maurizio Proietti, Sophie Renault
Enhancing Partial Deduction via Unfold/Fold Rules. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:146-168 [Conf]
- Germán Puebla, Manuel V. Hermenegildo
Abstract Specialization and Its Application to Program Parallelization. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:169-186 [Conf]
- Laurent Fribourg, Hans Olsén
Reductions of Petri Nets and Unfolding of Propositional Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:187-203 [Conf]
- Florence Benoy, Andy King
Inferring Argument Size Relationships with CLP(R). [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:204-223 [Conf]
- Jonathan C. Martin, Andy King, Paul Soper
Typed Norms for Typed Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:224-238 [Conf]
- Mihhail Matskin, Henryk Jan Komorowski, John Krogstie
Partial Deduction in the Framework of Structural Synthesis of Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:239-255 [Conf]
- Timothy S. Gegg-Harrison
Extensible Logic Program Schemata. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:256-274 [Conf]
- Antonio Brogi, Simone Contiero
Specialising Meta-level Compositions of Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:275-294 [Conf]
- Kung-Kiu Lau, Mario Ornaghi
Forms of Logic Specifications: A Preliminary Study. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:295-312 [Conf]
- Phan Minh Dung, Robert A. Kowalski, Francesca Toni
Synthesis of Proof Procedures for Default Reasoning. [Citation Graph (0, 0)][DBLP] LOPSTR, 1996, pp:313-324 [Conf]
|