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

Research output: Chapter in Book/Report/Conference proceedingChapter

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
PublisherSpringer
Pages258-271
Number of pages14
ISBN (Electronic)9783540878032
ISBN (Print)9783540878025
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume5293
ISSN (Print)0302-9743

Keywords

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

Fingerprint Dive into the research topics of 'Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness'. Together they form a unique fingerprint.

Cite this