Smaus, Jan-Georg (1998) Well-Terminating, Input-Driven Logic Programs. Technical report. University of Kent (KAR id:21583)
Postscript
Language: English |
|
Download this file (Postscript/198kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
PDF
Language: English |
|
Download this file (PDF/217kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
We identify a class of predicates for which termination does not depend on left-to-right execution. All that is required is that derivations are input-driven that is, in each derivation step, the input arguments of the selected atom do not become instantiated. The method of showing that a predicate is in that class is based on level mappings, closely following the traditional approach for LD derivations. Many predicates terminate under such weak assumptions. Knowing these predicates can be a very useful part of a more comprehensive method of showing termination, which would have to make more specific assumptions about the selection rule.
Item Type: | Reports and Papers (Technical report) |
---|---|
Uncontrolled keywords: | Logic programming, 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: | Mark Wheadon |
Date Deposited: | 25 Aug 2009 17:10 UTC |
Last Modified: | 16 Nov 2021 09:59 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21583 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):