Filter-based resolution principle for lattice-valued propositional logic LP(X)
- Publication Type:
- Journal Article
- Citation:
- Information Sciences, 2007, 177 (4), pp. 1046 - 1062
- Issue Date:
- 2007-02-15
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2007002524.pdf | 271.98 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
As one of most powerful approaches in automated reasoning, resolution principle has been introduced to non-classical logics, such as many-valued logic. However, most of the existing works are limited to the chain-type truth-value fields. Lattice-valued logic is a kind of important non-classical logic, which can be applied to describe and handle incomparability by the incomparable elements in its truth-value field. In this paper, a filter-based resolution principle for the lattice-valued propositional logic LP(X) based on lattice implication algebra is presented, where filter of the truth-value field being a lattice implication algebra is taken as the criterion for measuring the satisfiability of a lattice-valued logical formula. The notions and properties of lattice implication algebra, filter of lattice implication algebra, and the lattice-valued propositional logic LP(X) are given firstly. The definitions and structures of two kinds of lattice-valued logical formulae, i.e., the simple generalized clauses and complex generalized clauses, are presented then. Finally, the filter-based resolution principle is given and after that the soundness theorem and weak completeness theorems for the presented approach are proved. © 2006 Elsevier Inc. All rights reserved.
Please use this identifier to cite or link to this item: