Efficient Query Answering for Fuzzy Linguistic Logic Programming

Abstract

In fuzzy linguistic logic programming, there are two approaches to compute answers to queries w.r.t. a logic program: (i) by bottom-up iterating the immediate consequence operator TP; or (ii) by using the procedural semantics. The former is not goal-oriented and exhaustive. The latter is goal-oriented, but may lead to an infinite loop and recomputes subgoals in rule bodies. This paper presents an efficient tabulation proof procedure, which can overcome these problems, for fuzzy linguistic logic programming, shows its termination, and proves its soundness.