Termination proofs for logic programs /
Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a compreh...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin ; New York :
Springer-Verlag,
©1990
|
| Series: | Lecture notes in computer science ;
446 Lecture notes in computer science Lecture notes in artificial intelligence. |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|