Università di Pisa
Sistema bibliotecario di ateneo

On logic programs that do not fail

Pedreschi, Dino and Ruggieri, Salvatore (1997) On logic programs that do not fail. 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 (102Kb)


    This paper investigates the advantages of reasoning on logic programs and queries that have only successful derivations. We consider an extension of the logic programming paradigm that combines guarded clauses, in the style of concurrent logic languages, and dynamic selection rules. Some general conditions for a class of programs and queries are stated, which characterize when successful derivations only are present. A few practical instances of the general conditions are studied, and their applicability to real programs demonstrated. The main contributions of the proposed method are: (i) don't care non determinism can be safely adopted for programs that do not fail, (ii) termination of process networks expressed as logic programs can be proved, by means of a simple proof method developed for a fixed selection rule, and (iii) a strategy for parallelizing terminating Prolog programs is identified.

    Item Type: Book
    Uncontrolled Keywords: Guarded logic programs, Dynamic selection rules,
    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:14
    Last Modified: 23 Jan 2015 11:14
    URI: http://eprints.adm.unipi.it/id/eprint/1986

    Repository staff only actions

    View Item