Results 1 to 10 of about 74,540 (198)
α-Minimal Resolution Principle For A Lattice-Valued Logic [PDF]
International Journal of Computational Intelligence Systems, 2015 Based on the academic ideas of resolution-based automated reasoning and the previously established research work on binary α-resolution based automated reasoning schemes in the framework of lattice-valued logic with truth-values in a lattice ...
Hairui Jia, Yang Xu, Yi Liu, Jun Liu
doaj +6 more sources
Non-Clausal Multi-ary α-Generalized Resolution Calculus for a Finite Lattice-Valued Logic [PDF]
International Journal of Computational Intelligence Systems, 2018 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 +6 more sources
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems [PDF]
International Journal of Computational Intelligence Systems, 2015 In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system ℒ P(X) based on lattice implication algebra.
Weitao Xu +4 more
doaj +6 more sources
A Semi-lattice of Four-valued Literal-paraconsistent-paracomplete Logics
Bulletin of the Section of Logic, 2021 In this paper, we consider the class of four-valued literal-paraconsistent-paracomplete logics constructed by combination of isomorphs of classical logic CPC. These logics form a 10-element upper semi-lattice with respect to the functional embeddinig one
Natalya Tomova
doaj +3 more sources
Turing machines based on unsharp quantum logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs ...
Yun Shang, Xian Lu, Ruqian Lu
doaj +4 more sources
α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic [PDF]
International Journal of Computational Intelligence Systems, 2014 Based on the general form of α-resolution principle for a lattice-valued logic with truth-values defined in a lattice-valued logical algebra structure - lattice implication algebra, the further extended α-resolution method in this lattice ...
Xiaomei Zhong +3 more
doaj +2 more sources
Lattice Structure of Some Closed Classes for Three-Valued Logic and Its Applications [PDF]
Mathematics, 2021 This paper provides a brief overview of modern applications of nonbinary logic models, where the design of heterogeneous computing systems with small computing units based on three-valued logic produces a mathematically better and more effective solution
Elmira Yu. Kalimulina
doaj +2 more sources
Skolemization and Herbrand theorems for lattice-valued logics [PDF]
Theoretical Computer Science, 2019 Abstract Skolemization and Herbrand theorems are obtained for first-order logics based on algebras with a complete lattice reduct and operations that are monotone or antitone in each argument. These lattice-valued logics, defined as consequence relations on inequations between formulas, typically lack properties underlying automated reasoning in ...
Petr Cintula +2 more
openalex +4 more sources
Between quantum logic and concurrency [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every
Luca Bernardinello +2 more
doaj +4 more sources
A Comparison between Lattice-Valued Propositional Logic LP(X) and Gradational Lattice-Valued Propositional Logic Lvpl [PDF]
Proceedings on Intelligent Systems and Knowledge Engineering (ISKE2007), 2007 In order to provide a logical foundation for uncertain information processing theory, especially for the fuzziness, the incomparability uncertain information in the reasoning, Xu presented the lattice implication algebra by combining lattice and implication algebra in 1993 [1].
Zhiyan Chang +3 more
openalex +4 more sources