EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

1754 On Modular Termination Proofs of General Logic Programs

Home Policy Brochure Browse Search User Area Contact Help

Bossi, A. and Cocco, N. and Etalle, S. and Rossi, S. (2002) On Modular Termination Proofs of General Logic Programs. Theory and Practice of Logic Programming, 2 (3). pp. 263-291. ISSN 1471-0684 *** ISI Impact 1,250 ***

This is the latest version of this eprint.

Full text available as:

PDF

- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
302 Kb

Official URL: http://arxiv.org/abs/cs.LO/0005018

Abstract

We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider programs consisting of a hierarchy of modules and supply a general result for proving termination by dealing with each module separately. For programs which are in a certain sense well-behaved, namely well-moded or well-typed programs, we derive both a simple verification technique and an iterative proof method. Some examples show how our system allows for greatly simplified proofs.

Item Type:	Article
Research Group:	EWI-DIES: Distributed and Embedded Security
Additional Information:	Imported from DIES
ID Code:	1754
Status:	Published
Deposited On:	30 April 2006
Refereed:	Yes
International:	Yes
ISI Impact Factor:	1,250
More Information:	statistics

Available Versions of this Item

On Modular Termination Proofs of General Logic Programs (deposited 30 April 2006)
[Currently Displayed]

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item