\(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) (Q5946276): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5331549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4068686 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4693184 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axiom schemes for <i>m</i>-valued propositions calculi / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5661846 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The logic of inexact concepts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Fuzzy Logic I Many‐valued rules of inference / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: First-order fuzzy logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy sets in a approximate reasoning. I: Inference with possibility distributions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4139711 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completely non-clausal theorem proving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994754 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some properties of fuzzy logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy Logic and the Resolution Principle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Specialization of Programs by Theorem Proving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inference in a multivalued logic system / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy operator logic and fuzzy resolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3760507 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resolution principles in possibilistic logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4121876 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3870868 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3714047 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eine dreiwertige Logik zur Verarbeitung partieller Information. (A three- valued logic for partial information processing) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4281690 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4289327 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paraconsistent logic programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paraconsistent disjunctive deductive databases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3204442 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The completeness of gp-resolution for annotated logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Special relations in automated deduction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273485 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4881605 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4255505 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4693586 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4275476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2705301 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Filters and structure of lattice implication algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4231009 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4237708 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4351520 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4392565 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4392561 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4234679 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4942559 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4942561 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4311753 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4306528 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2793320 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2793337 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(L\)-valued propositional logic \(L_{\text{vpl}}\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON SEMANTICS OF L-VALUED FIRST-ORDER LOGIC L<sub>vft</sub> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2793364 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:44, 3 June 2024
scientific article; zbMATH DE number 1658613
Language | Label | Description | Also known as |
---|---|---|---|
English | \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) |
scientific article; zbMATH DE number 1658613 |
Statements
\(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) (English)
0 references
19 June 2002
0 references
The authors of this article consider a system of many-valued reasoning they have worked on since 1990. It is lattice-valued propositional logic \(LP(X)\) having as algebraic counterpart lattice implication algebra. A lattice implication algebra is a special case of a Wajsberg algebra \((A,\neg,\to,1)\), where the set of truth values \(A\) is a bounded lattice, negation \(\neg\) is involution and implication \(\to\) is distributive relative to meet and join in the lattice \(A\). The \(\alpha\)-resolution principle the authors essentially deal with is simply a variant of many-valued binary resolution widely discussed in literature. Using the rule of \(\alpha\)-resolution, one can cut a pair of clauses whose conjunction, speaking informally, is less than some \(\alpha\) in the lattice of truth values. This rule gives rise to the notion of \(\alpha\)-refutation, i.e. a deduction by \(\alpha\)-resolution that ends with the empty clause. The authors state that their resolution rule modification can be applied to checking the consistency of sets of clauses under uncertainity conditions. This resolution has an interesting feature: for some truth value \(\alpha\) one can deduce the empty clause, but for another value, not comparable to \(\alpha\), the empty clause may not be deduced. In other words, the lattice structure of the set of truth values of \(LP(X)\) provides a logic with incomparable objects. The main disadvantage of this article is that some notions used in the proofs of soundness and completeness are not defined. So in order to check the correctness of the proofs the reader should consult earlier works, e.g. \textit{Y. Xu} and \textit{K. Qin}, ``Lattice-valued propositional logic. I'' [J. Southwest Jiaotong Univ., Engl. Version 1, No. 2, 123-128 (1993; Zbl 0807.03020)].
0 references
many-valued logic
0 references
resolution principle
0 references
lattice-valued logic
0 references
many-valued reasoning
0 references