Smaus, Jan-Georg and Hill, Pat and King, Andy (1998) Termination of Logic Programs with block Declarations Running in Several Modes. In: Palamidessi, Catuscia, ed. International Symposium on Programming Languages: Implementations, Logics and Programs. Lecture Notes in Computer Science, 1490 . Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html, pp. 182-196. ISBN 3-540-65012-1. (KAR id:21647)
PDF
Language: English |
|
Download this file (PDF/278kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
We show how termination of logic programs with delay declarations can be proven. Three features are distinctive of this work: (a) we assume that predicates can be used in several modes; (b) we show that block declarations, which are a very simple delay construct, are sufficient; (c) we take the selection rule into account, assuming it to be as in most Prolog implementations. Our method is based on identifying the so-called robust predicates, for which the textual position of an atom using this predicate is irrelevant. The method can be used to verify existing programs, and to assist in writing new programs. As a byproduct, we also show how programs can be proven to be free from occur-check and floundering.
Item Type: | Book section |
---|---|
Uncontrolled keywords: | Logic programming, coroutining, delay declarations, block declarations, termination, modes, selection rules |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 22 Aug 2009 15:16 UTC |
Last Modified: | 05 Nov 2024 10:00 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21647 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):