Goal-Directed Methods for Łukasiewicz Logic

  • George Metcalfe
  • Nicola Olivetti
  • Dov Gabbay
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3210)

Abstract

In this paper we present goal-directed deduction methods for Łukasiewicz infinite-valued logic Ł giving logic programming style algorithms which both have a logical interpretation and provide a suitable basis for implementation. We begin by considering a basic version with connections to calculi for other logics, then make refinements to obtain greater efficiency and termination properties, and to deal with further connectives and truth constants. We finish by considering applications of these algorithms to fuzzy logic programming.

Keywords

Łukasiewicz Logics Fuzzy Logics Goal-Directed Methods 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • George Metcalfe
    • 1
  • Nicola Olivetti
    • 2
  • Dov Gabbay
    • 1
  1. 1.Department of Computer ScienceKing’s College LondonStrand, LondonUK
  2. 2.Department of Computer ScienceUniversity of TurinTurinItaly

Personalised recommendations