![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Logic Programming, Volume 30
Volume 30, Number 1, January 1997
- Juergen Haas, Bharat Jayaraman:
From Context-Free to Definite-Clause Grammars: A Type-Theoretic Approach. 1-23 - Zheng Lin:
Parallel Execution of Logic Programs by Load Sharing. 25-51 - Michael Codish
, Moreno Falaschi
, Kim Marriott, William H. Winsborough:
A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs. 53-81 - Chitta Baral:
Embedding Revision Programs in Logic Programming Situation Calculus. 83-97
Volume 30, Number 2, February 1997
- Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein:
Order Sorted Feature Theory Unification. 99-124 - Teodor C. Przymusinski, Hudson Turner:
Update by Means of Inference Rules. 125-143 - Paul Tarau, Koenraad De Bosschere, Bart Demoen:
On Delphi Lemmas and other Memoing Techniques for Deterministic Logic Programs. 145-163 - Heinrich Herre, Gerd Wagner
:
Stable Models Are Generated by a Stabel Chain. 165-177
Volume 30, Number 3, March 1997
- Raymond T. Ng, Xiaomei Tian:
Incremental Algorithms for Optimizing Model Computation Based on Partial Instantiation. 179-204 - Christopher P. Higgins:
On Integrating Objects and Relations Using Multimethods. 205-221 - Paulo Jorge de Sousa Azevedo:
Magic Sets with Full Sharing. 223-237 - Kung-Kiu Lau, Mario Ornaghi:
The Relationship Between Logic Programs and Specifications - The Subset Example Revisited. 239-257
![](https://dblp1.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.