Loading...
Please wait, while we are loading the content...
Similar Documents
Modular termination proofs for logic and pure PROLOG programs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Apt, Krzysztof R. Pedreschi, Dino |
| Copyright Year | 1993 |
| Abstract | We provide a uniform and simpliied presentation of the methods of Bezem Bez93] ((rst published as Bez89]) and of Apt and Pedreschi AP93] ((rst published as AP90]) for proving termination of logic and Prolog programs. Then we show how these methods can be reened so that they can be used in a modular way. |
| Starting Page | 183 |
| Ending Page | 229 |
| Page Count | 47 |
| File Format | PDF HTM / HTML |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |