Abstract
In the present paper, resolution-based automated reasoning theory in an L-type fuzzy logic is focused. Concretely, the α-resolution principle, which is based on lattice-valued propositional logic LP(X) with truth-value in a logical algebra - lattice implication algebra, is investigated. Finally, an α-resolution principle that can be used to judge if a lattice-valued logical formula in LP(X) is always false at a truth-valued level α (i.e., α-false), is established, and the theorems of both soundness and completeness of this α-resolution principle are also proved. This will become the theoretical foundation for automated reasoning based on lattice-valued logical LP(X).
| Original language | English |
|---|---|
| Pages (from-to) | 195-223 |
| Number of pages | 29 |
| Journal | Information Sciences |
| Volume | 130 |
| Issue number | 1-4 |
| DOIs | |
| State | Published - Dec 2000 |
Funding
The work was supported by the Project of Flanders-China cooperation (1999) and the National Natural Science Foundation of People's Republic of China with Grant No. 69674015 and 69774016.
| Funders | Funder number |
|---|---|
| Not added | 69674015, 69774016 |
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence