Results 11 to 20 of about 25,501 (266)
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
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
α-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 +3 more sources
Mendler-style Iso-(Co)inductive predicates: a strongly normalizing approach [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles.
Favio Ezequiel Miranda-Perea +1 more
doaj +4 more sources
α-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 +3 more sources
α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X) [PDF]
International Journal of Computational Intelligence Systems, 2014 This paper is focused on α-generalized semantic resolution automated reasoning method in linguistic truth-valued lattice-valued propositional logic.
Jiafeng Zhang, Yang Xu, Xingxing He
doaj +1 more source
α-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 +1 more source
α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic [PDF]
International Journal of Computational Intelligence Systems, 2012 This paper focuses on effcient non-clausal resolution-based automated reasoning methods and algorithms for a lattice-ordered linguistic truth-valued logic, which corresponds to extensions of α-lock resolution.
Xingxing He +3 more
doaj +1 more source
Interval-Valued General Residuated Lattice-Ordered Groupoids and Expanded Triangle Algebras
Axioms, 2022 As an extension of interval-valued pseudo t-norms, interval-valued pseudo-overlap functions (IPOFs) play a vital role in solving interval-valued multi-attribute decision making problems.
Xiaohong Zhang, Rong Liang
doaj +1 more source
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 +1 more source