Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Multi-ary α-ordered linear minimal resolution method in lattice-valued logic system

View through CrossRef
On the basis of α-minimal resolution principle, an α-n(t)-ary resolution dynamic automated reasoning method—multi-ary α-ordered linear minimal resolution method is studied in lattice-valued propositional logic system LP(X) and lattice-valued first-order logic system LF(X) based on lattice implication algebra (LIA). Firstly, multi-ary α-ordered linear minimal resolution method is established in LP(X), while its theorems of both soundness and completeness are proved. Then, multi-ary α-ordered linear minimal resolution method is further established in the corresponding lattice-valued first-order logic LF(X), along with its soundness theorem, lifting lemma, and completeness theorem. Then, the validity of multi-ary α-ordered linear minimal resolution based on lattice-valued logic is analyzed. At last, an multi-ary α-ordered linear minimal resolution algorithm in LP(X) is designed, and it is proved to be sound and complete, then it is further extended in the corresponding LF(X). This lays the foundation for the further study on α-n(t)-ary resolution dynamic automated reasoning program.
Title: Multi-ary α-ordered linear minimal resolution method in lattice-valued logic system
Description:
On the basis of α-minimal resolution principle, an α-n(t)-ary resolution dynamic automated reasoning method—multi-ary α-ordered linear minimal resolution method is studied in lattice-valued propositional logic system LP(X) and lattice-valued first-order logic system LF(X) based on lattice implication algebra (LIA).
Firstly, multi-ary α-ordered linear minimal resolution method is established in LP(X), while its theorems of both soundness and completeness are proved.
Then, multi-ary α-ordered linear minimal resolution method is further established in the corresponding lattice-valued first-order logic LF(X), along with its soundness theorem, lifting lemma, and completeness theorem.
Then, the validity of multi-ary α-ordered linear minimal resolution based on lattice-valued logic is analyzed.
At last, an multi-ary α-ordered linear minimal resolution algorithm in LP(X) is designed, and it is proved to be sound and complete, then it is further extended in the corresponding LF(X).
This lays the foundation for the further study on α-n(t)-ary resolution dynamic automated reasoning program.

Related Results

MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
Context. This paper addresses issues relevant to the EDA market – reducing the cost and time of testing and verification of digital projects by synthesizing the logic vector of a d...
Almost n-ary Subsemigroups and Fuzzy Almost n-ary Subsemigroups of n-ary Semigroups
Almost n-ary Subsemigroups and Fuzzy Almost n-ary Subsemigroups of n-ary Semigroups
An n-ary semigroup is a non-empty set with an associative n-ary operation. Semi-groups and ternary semigroups are special cases of n-ary semigroups where n = 2 and n = 3,respective...
The structured vacuum theory
The structured vacuum theory
The novel physical model sheds light on the matter spatiotemporal organization of the universe. It makes an attempt to create a basis for revealing the hidden mechanisms underlying...
Logic in the early 20th century
Logic in the early 20th century
The creation of modern logic is one of the most stunning achievements of mathematics and philosophy in the twentieth century. Modern logic – sometimes called logistic, symbolic log...
Single-Valued Neutrosophic Ideal Approximation Spaces
Single-Valued Neutrosophic Ideal Approximation Spaces
In this paper, we defined the basic idea of the single-valued neutrosophic upper (αn)δ, single-valued neutrosophic lower (αn)δ and single-valued neutrosophic boundary sets (αn)B of...
Valid Arguments and Heyting Algebra using Multi Valued Logic
Valid Arguments and Heyting Algebra using Multi Valued Logic
Over last three decades, multi valued logic (MVL) has been receiving considerable attention. So, we focus our concentration upon multi valued logic using some of the rules of mathe...
Direct and semidirect product of n-ary polygroups via n-ary factor polygroups
Direct and semidirect product of n-ary polygroups via n-ary factor polygroups
In this paper, we define an equivalence relation induced by [Formula: see text]-ary subpolygroups and show that such relation is full conjugation when [Formula: see text]-ary subpo...
Equivalence of lattice operators and graph matrices
Equivalence of lattice operators and graph matrices
Abstract We explore the relationship between lattice field theory and graph theory, placing special emphasis on the interplay between Dirac and scalar lattice operat...

Back to Top