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 +2 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
Belief–logic conflict resolution in syllogistic reasoning: Inspection-time evidence for a parallel process model [PDF]
, 2008 An experiment is reported examining dual-process models of belief bias in syllogistic reasoning using a problem complexity manipulation and an inspection-time method to monitor processing latencies for premises and conclusions.
Ball, Linden, Stupple, Edward J.N
core +3 more sources
Optics Express, 2018 W-band inverse synthetic aperture radar (ISAR) imaging systems are very useful for automatic target recognition and classification due to their high spatial resolution, high penetration and small antenna size.
Shaowen Peng +6 more
openalex +2 more sources
Linear Resolution for Fuzzy Logic Program
Journal of Japan Society for Fuzzy Theory and Systems, 1994 Summary: Fuzzy logic programming is the theoretical foundation of Fuzzy Prolog, which is a fuzzy programming language based on fuzzy logic. In this paper, fuzzy logic programming is defined such that (1) fuzzy definite clause which is a logic formula for a representation of uncertain assertion, (2) fuzzy logical consequence which is a fuzzy definite ...
Hiroaki Kikuchi, Masao Mukaidono
openalex +4 more sources
Joint unsupervised coreference resolution with Markov logic [PDF]
Conference on Empirical Methods in Natural Language Processing, 2008 Machine learning approaches to coreference resolution are typically supervised, and require expensive labeled data. Some unsupervised approaches have been proposed (e.g., Haghighi and Klein (2007)), but they are less accurate.
Hoifung Poon, Pedro Domingos
openalex +2 more sources
Molecular logic gates based on programmable self-assembly of DNA origami triangles for the detection of nucleic acid molecules [PDF]
Scientific ReportsThe development of programmable DNA origami architectures with combinatorial complexity remains a critical challenge in molecular nanotechnology. This study develops a programmable nucleic acid detection platform by integrating DNA origami nanostructures
Si Sun +4 more
doaj +2 more sources
A 28 mK Resolution, -0.45 °C/+0.51 °C Inaccuracy Temperature Sensor Using Dual-Comparator Architecture and Logic-Controlled Counting Method. [PDF]
Micromachines (Basel)Xu Y, Luo T, Peng L.
europepmc +3 more sources
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +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