![](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
Journal of Logic Programming, Volume 41
Volume 41, Number 1, October 1999
- Joeri Engelfriet, Heinrich Herre:
Stable Generated Models, Partial Temporal Logic and Disjunctive Defaults. 1-25 - Birgit Elbl:
A Declarative Semantics for Depth-First Logic Programs. 27-66 - Catherine Belleannée, Pascal Brisset, Olivier Ridoux:
A Pragmatic Reconstruction of lambda-Prolog. 67-102 - Michael Codish
, Cohavit Taboch:
A Semantic Basis for the Termination Analysis of Logic Programs. 103-123 - Michael Codish
:
Worst-Case Groundness Analysis Using Positive Boolean Functions. 125-128 - Christos H. Papadimitriou, Martha Sideri:
On the Floyd-Warshall Algorithm for Logic Programs. 129-137
Volume 41, Number 2-3, November 1999
- Annalisa Bossi, Yves Deville
:
Guest Editors' Introduction Special Issue: Synthesis, Transformation and Analysis of Logic Rrograms 2. 139-140 - Pierre Flener
, Serap Yilmaz:
Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects. 141-195 - Alberto Pettorossi
, Maurizio Proietti
:
Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs. 197-230 - Danny De Schreye
, Robert Glück
, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen:
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. 231-277 - Germán Puebla, Manuel V. Hermenegildo
:
Abstract Multiple Specialization and Its Application to Program Parallelization. 279-316
![](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.