Towards a fuzzy logic programming system: a clausal form fuzzy logic

作者:

Highlights:

摘要

Traditional logic and logic programming languages cannot handle uncertainty. Fuzzy logic can, but it requires a readily computable form. One possible way to achieve this is to define a propositional fuzzy logic, extend this to a first order form, convert it to Horn clause form, and, finally, to devise a theorem prover to manipulate the Horn clauses. The first two steps have already been published. The paper completes the exercise by deriving a fuzzy Horn clause logic from the first order logic already published, and proposing a theorem prover to manipulate these clauses.

论文关键词:computational reasoning,fuzzy clausal logic, fuzzy theorem prover, predicates, qualifiers

论文评审过程:Received 25 November 1993, Accepted 22 September 1994, Available online 20 April 2000.

论文官网地址:https://doi.org/10.1016/0950-7051(95)96214-C