Tabulation proof procedures for fuzzy linguistic logic programming

•The non-deterministic procedure is goal-oriented, sound, and complete and terminates.•The deterministic procedure is more efficient than the non-deterministic one.•The number and size of trees created by the deterministic procedure are less.•The deterministic procedure gives all and only the most general answers to a query.•The deterministic procedure enables threshold computation and top-k retrieval.