Research

Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness


Reference:

Komendantskaya, E. and Power, J., 2008. Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. In: Logics in Artificial Intelligence 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings. Vol. 5293. Heidelberg: Springer, pp. 258-271.

Related documents:

[img]
Preview
PDF (Power_JELIA_2008.pdf) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (799kB) | Preview

    Official URL:

    http://dx.doi.org/10.1007/978-3-540-87803-2_22

    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.

    Details

    Item Type Book Sections
    CreatorsKomendantskaya, E.and Power, J.
    DOI10.1007/978-3-540-87803-2_22
    DepartmentsFaculty of Science > Computer Science
    Publisher StatementPower_JELIA_2008.pdf: The original publication is available at www.springerlink.com
    RefereedNo
    StatusPublished
    ID Code26518

    Export

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...