Fibrational semantics for many-valued logic programs: grounds for non-groundness

Ekaterina Komendantskaya, John Power

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)

    Abstract

    We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-resolution for annotation-free many valued logic programs as defined by Fitting, and prove a soundness and completeness result relating the two. We show that fibrational semantics corresponds with the traditional declarative (ground) semantics and deduce a soundness and completeness result for our SLD-resolution algorithm with respect to the ground semantics.

    Original languageEnglish
    Title of host publicationLogics in Artifiicial Intelligence
    Subtitle of host publication11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings
    EditorsSteffen Hölldobler, Carsten Lutz, Heinrich Wansing
    Place of PublicationBerlin
    PublisherSpringer
    Pages258-271
    Number of pages14
    ISBN (Electronic)9783540878032
    ISBN (Print)9783540878025
    DOIs
    Publication statusPublished - 2008
    Event11th European Conference on Logics in Artificial Intelligence - Computer Science Faculty building of Technische Universität Dresden, Dresden, Germany
    Duration: 28 Sep 20081 Oct 2008
    http://www.jelia.eu/2008/

    Publication series

    NameLecture notes in computer science
    PublisherSpringer
    Volume5293
    ISSN (Print)0302-9743

    Conference

    Conference11th European Conference on Logics in Artificial Intelligence
    Abbreviated titleJELIA 2008
    CountryGermany
    CityDresden
    Period28/09/081/10/08
    Internet address

    Keywords

    • Many-valued logic programs
    • categorical logic
    • fibrational semantics
    • ground semantics
    • SLD-resolution
    • DEDUCTION

    Cite this