UnipiEprints
Università di Pisa
Sistema bibliotecario di ateneo

$\exists$-universal termination of logic programs

Ruggieri, Salvatore (1998) $\exists$-universal termination of logic programs. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (144Kb)

    Abstract

    We introduce the notion of $\exists$-universal termination of logic programs. A program P and a goal G $\exists$-universally terminate iff there exists a selection rule S such that every SLD-derivation of P U { G }$via S is finite. We claim that it is an essential concept for declarative programming, where a crucial point is to associate a terminating control strategy to programs and goals. We show that $\exists$-universal termination and universal termination via fair selection rules coincide. Then we offer a characterization of $\exists$-universal termination by defining fair-bounded programs and goals. They provide us with a correct and complete method of proving $\exists$-universal termination. We show other valuable properties of fair-bounded programs and goals, including persistency, modularity, ease of use in paper & pencil proofs, automatization of proofs.

    Item Type: Book
    Uncontrolled Keywords: Logic Programs, Universal Termination, Fair
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 23 Jan 2015 11:16
    Last Modified: 23 Jan 2015 11:16
    URI: http://eprints.adm.unipi.it/id/eprint/1991

    Repository staff only actions

    View Item