Termination Proofs for Logic Programs - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

9

(FIVE YEARS 0)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540528371, 9783540471639

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Conclusions

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_9 ◽

1990 ◽

pp. 130-131

Introduction

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_1 ◽

1990 ◽

pp. 1-5

And/or dataflow graphs

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_6 ◽

1990 ◽

pp. 72-84

Keyword(s):

Dataflow Graphs

Basic notions

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_2 ◽

1990 ◽

pp. 6-16

Integration of unfolding techniques

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_8 ◽

1990 ◽

pp. 109-129

The problem of local variables

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_5 ◽

1990 ◽

pp. 61-71

Terminating logic programs

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_4 ◽

1990 ◽

pp. 41-60

Keyword(s):

Logic Programs

Static program properties and transformations

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_3 ◽

1990 ◽

pp. 17-40

A termination proof procedure

Termination Proofs for Logic Programs - Lecture Notes in Computer Science ◽

10.1007/3-540-52837-7_7 ◽

1990 ◽

pp. 85-108

Keyword(s):

Termination Proof ◽

Proof Procedure