Results 31 to 40 of about 25,501 (266)
Determination of 3-Ary -Resolution in Lattice-valued Propositional Logic LP(X) [PDF]
One of key issues for -() ary resolution automated reasoning based on lattice-valued logic with truth-value in a lattice implication algebra is to investigate the -() ary resolution of some generalized literals.
Yi Liu, Hairui Jia, Yang Xu
doaj +1 more source
Regular Partial Residuated Lattices and Their Filters
To express wider uncertainty, Běhounek and Daňková studied fuzzy partial logic and partial function. At the same time, Borzooei generalized t-norms and put forward the concept of partial t-norms when studying lattice valued quantum effect algebras. Based
Nan Sheng, Xiaohong Zhang
doaj +1 more source
Non-Clausal Multi-ary α-Generalized Resolution Calculus for a Finite Lattice-Valued Logic
Due to the need of the logical foundation for uncertain information processing, development of efficient automated reasoning system based on non-classical logics is always an active research area.
Yang Xu +4 more
doaj +1 more source
A Logic for Dually Hemimorphic Semi-Heyting Algebras and its Axiomatic Extensions
The variety \(\mathbb{DHMSH}\) of dually hemimorphic semi-Heyting algebras was introduced in 2011 by the second author as an expansion of semi-Heyting algebras by a dual hemimorphism.
Juan Manuel Cornejo +1 more
doaj +1 more source
Orthomodular-Valued Models for Quantum Set Theory [PDF]
In 1981, Takeuti introduced quantum set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed linear subspaces of a Hilbert space in a manner analogous to Boolean-valued models of set theory, and showed ...
Araki +11 more
core +2 more sources
A Linguistic-Valued Approximate Reasoning Approach for Financial Decision Making
In order to process the linguistic-valued information with uncertainty in the financial decision- making, the present work uses a lattice-valued logical algebra - lattice implication algebra to deal with both comparable and incomparable linguistic truth ...
Xin Liu, Ying Wang, Xiaonan Li, Li Zou
doaj +1 more source
Canonical Completeness in Lattice-Based Languages for Attribute-Based Access Control [PDF]
The study of canonically complete attribute-based access control (ABAC) languages is relatively new. A canonically complete language is useful as it is functionally complete and provides a "normal form" for policies. However, previous work on canonically
Crampton, Jason, Williams, Conrad
core +2 more sources
Admissibility in Finitely Generated Quasivarieties [PDF]
Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable ...
Metcalfe, George +1 more
core +4 more sources
The arity gap of polynomial functions over bounded distributive lattices [PDF]
Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B is the minimum decrease in its essential arity when essential arguments of f are identified.
Couceiro, Miguel, Lehtonen, Erkko
core +1 more source
Algebraic semantics for one-variable lattice-valued logics
The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic semantics for these logics have been obtained: most notably, for the modal counterparts S5 and MIPC of the one ...
Cintula, Petr +2 more
openaire +2 more sources

