Results 31 to 40 of about 1,395,634 (216)
On an algebra of lattice-valued logic
AbstractThe purpose of this paper is to present an algebraic generalization of the traditional two-valued logic. This involves introducing a theory of automorphism algebras, which is an algebraic theory of many-valued logic having a complete lattice as the set of truth values.
openaire +3 more sources
Categorical study for Algebras of lattice-valued logic and lattice-valued modal logic
The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of functors. As a result, we get a duality for algebras of lattice-valued logic.
Ray, Kumar Sankar, Das, Litan Kumar
openaire +2 more sources
$$\alpha $$-Paramodulation method for a lattice-valued logic $$L_nF(X)$$ with equality [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xingxing He +3 more
openaire +1 more source
On the enumeration of maximal infinitely-generated classes of 01-functions in three-valued logic
Background. The superposition operation is the main operation in the study of multivalued logic functions. On the basis of this operation, classifications of multivalued logic functions are defined, which allow to solve important problems of ...
S.S. Marchenkov
doaj +1 more source
As a continuation of our research work on resolution-based automated reasoning approaches for lattice-valued logic systems with truth-values in a lattice-valued logical algebraic structure s lattice implication algebra (LIA), in the present paper, we ...
Xu, Yang +7 more
core +1 more source
Closed classes under superposition are examined in $k$-valued logic. E.~Post established that the lattice (on inclusion) of all closed classes in two-valued logic is countable. Besides, each closed class has a finite basis in two-valued logic.
S.N. Selezneva
doaj +1 more source
Graded Many-Valued Modal Logic and Its Graded Rough Truth
Much attention is focused on the relationship between rough sets and many-valued modal logic to deal with approximate reasoning. This paper discusses the graded modal logic and puts forward the graded many-valued modal logic G(S5). Secondly, by employing
Zengtai Gong, Jiansheng Li
core +1 more source
An assertion language for constraint logic programs [PDF]
In an advanced program development environment, such as that discussed in the introduction of this book, several tools may coexist which handle both the program and information on the program in different ways.
Francisco Bueno +5 more
core +1 more source
Toward Full Interoperability in Materials Science: Integrating Workflows With Knowledge Graphs
The connection of conceptual workflow design, portable execution, and ontology‐based semantics leading to provenance‐rich knowledge graphs are main contributors to interoperability in materials science and a prerequisite to AI‐assisted orchestration and for interoperable Materials Acceleration Platforms.
Jan Janssen +14 more
wiley +1 more source
This perspective reframes additive manufacturing for electrical machines as a qualification‐limited materials and architecture design problem. It links process–structure–property–performance relationships to magnetic, conducting, dielectric, and thermal property windows, highlighting where AM can enable segmented magnetic circuits, permanent magnet ...
Dénes Fodor, Loránd Szabó
wiley +1 more source

