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

  • Authors:
  • Ekaterina Komendantskaya;John Power

  • Affiliations:
  • INRIA Sophia Antipolis, France;University of Bath, UK

  • Venue:
  • JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.