Further results of fuzzy linguistic logic programming

Authors

  • Hung Van Le Faculty of Information Technology, University of Mining and Geology
  • Khang Dinh Tran School of Information and Communication Technology, Hanoi University of Science and Technology

DOI:

https://doi.org/10.15625/1813-9663/30/2/2825

Keywords:

Logic programming, fuzzy logic, hedge algebra, computing with words, completeness.

Abstract

Fuzzy linguistic logic programming is introduced to represent and reason with linguistically-expressed human knowledge, where the truth of vague sentences is given in linguistic terms, and linguistic hedges can be used to indicate different levels of emphasis.

Fuzzy linguistic logic programming has been shown to have fundamental notions and results of a logic programming framework, especially of the declarative semantics, procedural semantics, and fixpoint semantics. The procedural semantics are sound, complete and directly manipulates linguistic terms in order to compute answers to queries.

In this paper, we prove some additional results of fuzzy linguistic logic programming, which can be considered as a counterpart of those of traditional definite logic programming. We also show that it has a generalized Pavelka-style completeness. Moreover, the possibility that aggregation operators can occur in rule bodies is also discussed.

Metrics

Metrics Loading ...

Downloads

Published

2014-06-10

How to Cite

[1]
H. V. Le and K. D. Tran, “Further results of fuzzy linguistic logic programming”, JCC, vol. 30, no. 2, pp. 139–147, Jun. 2014.

Issue

Section

Computer Science