Łukasiewicz Logic: From Proof Systems To Logic Programming

Logic Journal of the IGPL 13 (5):561-585 (2005)
  Copy   BIBTEX

Abstract

We present logic programming style “goal-directed” proof methods for Łukasiewicz logic Ł that both have a logical interpretation, and provide a suitable basis for implementation. We introduce a basic version, similar to goal-directed calculi for other logics, and make refinements to improve efficiency and obtain termination. We then provide an algorithm for fuzzy logic programming in Rational Pavelka logic RPL, an extension of Ł with rational constants

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-02-04

Downloads
21 (#762,792)

6 months
9 (#355,374)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dov Gabbay
Hebrew University of Jerusalem

References found in this work

A theorem about infinite-valued sentential logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
The Uniform Proof-Theoretic Foundation of Linear Logic Programming.J. A. Harland & D. J. Pym - 1991 - LFCS, Department of Computer Science, University of Edinburgh.

Add more references