Goal-directed methods for lukasiewicz logic

George Metcalfe, Nicola Olivetti, Dov Gabbay

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

4 Scopus citations

Abstract

In this paper we present goal-directed deduction methods for Lukasiewicz infinite-valued logic L, 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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsJerzy Marcinkowski, Andrzej Tarlecki
PublisherSpringer Verlag
Pages85-99
Number of pages15
ISBN (Print)3540230246, 9783540230243
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3210
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Fuzzy Logics
  • Goal-Directed Methods
  • Lukasiewicz Logics

Fingerprint

Dive into the research topics of 'Goal-directed methods for lukasiewicz logic'. Together they form a unique fingerprint.

Cite this