• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    International Symposium on Multiple-Valued Logic

    International Symposium on Multiple-Valued Logic

    Conference

    年发文量

    研究主题

    论文(1838)

    排序
    1A Dual Weak Complementation on the Lattice of Filters of a Weakly Dicomplemented Lattice : to the Memory of Prof. Tonga Marcel, 11.04.1951 - - 15.09.2025
    Leonard Kwuida, Yannick Léa Tenkeu Jeufack

    In this paper, we show that the lattice of filters of a weakly dicomplemented lattice L can be endowed with a dual weak complementation. Its sublattice of principal filters is shown to be dually isomorphic to the weakly complemented reduct of L. Dense elements and skeletons are revisited. A connection is established between filters of skeletons and certain filters of L.

    2026
    引用
    AI阅读
    加入学术空间
    2Completeness Theorem for Many-valued Logic with Internalized Meta-judgment
    Yang Song, Tsubasa Takagi

    We propose many-valued logic with internalized meta-judgment (MLIM) and prove its completeness. The syntax of MLIM has a new operator to judge whether the truth value of a formula is a designated value in the original many-valued logic. Using MLIM, designated values are incorporated into its syntax, enabling many-valued logic to be treated as classical logic. The semantics of MLIM is a pair semantics, which determines the validity of formulas by a pair of truth values. The proof theory of MLIM is given as natural deduction obtained by combining the inference rules of classical logic and many-valued logic.

    2026
    引用
    AI阅读
    加入学术空间
    3Reducing Signed SAT to Mixed Integer Linear Programming
    Elifnaz Yangin

    We introduce a novel reduction from the satisfiability problem for a set of propositional signed clauses (Signed SAT) to Mixed Integer Linear Programming (MILP). This reduction provides a scalable and effective approach for solving Signed SAT instances via MILP and can be extended to address a broad class of NP-complete combinatorial decision problems through their reduction to Signed SAT. Furthermore, we present a reduction for a variant of Signed SAT in which each clause is expressed as a disjunction of signed literals rather than as a signed disjunction of literals. Finally, we discuss how these reductions can be adapted for pseudo-Boolean (PB) solving, enabling the use of PB solvers that exploit SAT-based techniques.

    2026
    引用
    AI阅读
    加入学术空间
    4Human-Feasible Swallowing Posture Optimization with a Body Motion Link Model for Aspiration Risk Reduction
    Aoi Endo,Naomi Yagi,Katsuya Nakamura,Shinsuke Nagami,Syoji Kobashi

    This study introduces a human-feasible posture optimization framework that reduces aspiration risk using camera-derived posture information. Joint angles are estimated from sagittal-view images with a body motion link model, aspiration risk is predicted using a machine learning classifier, and posture adjustments are identified through optimization constrained by biomechanical range-of-motion (ROM) limits. In experiments with 68 older adults, constrained optimization reduced predicted aspiration risk by 22.7% while avoiding the anatomically unrealistic postures produced by unconstrained optimization. These findings demonstrate that physiologically grounded constraints are essential for reliable and clinically meaningful posture guidance in aspiration prevention.

    2026
    引用
    AI阅读
    加入学术空间
    5Structure of Haar Spectra of Ternary Bent Functions
    Radomir S. Stanković,Milena Stanković,Claudio Moraga, Jaakko T. Astola

    The paper presents a discussion of the structure of Haar spectra for ternary bent functions, where the term structure refers to the arrangement of Haar spectral coefficients per packets corresponding to the arrangement of Haar functions used as the kernel of the Haar transform. For a bent function, by considering pairs of 2/3 of Haar coefficients at the same positions in the last two packets in the Haar spectrum, we observe that in the function vector of a bent function, the function values are arranged into triples of adjacent elements of the vector. In construction of bent functions, manipulation the initial bent function over these triples, including re-arrangement of values into new triples, preserve bentness. From each bent function in n variables which has 1/3 zero-valued pairs of Haar coefficients from the last two packets, it can be constructed a set of other bent functions in n variables by referring to the values of bent functions in (n−2) variables.

    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 1838 篇论文

    高被引作者

    作者引用发文
    Robert Wille136334
    Rolf Drechsler108623
    D. Michael Miller103330
    Marek Andrzej Perkowski101761
    Gerhard W. Dueck88922
    Daniel Große7348
    T. Sasao71822
    Victor Veitch6471
    Joseph Emerson6471
    Mark Howard6471

    高产作者

    作者引用发文
    Radomir S. Stankovic59178
    Claudio Moraga62475
    Tsutomu Sasao58865
    Marek Andrzej Perkowski101761
    Michitaka Kameyama40650
    Rolf Drechsler64145
    Takahiro Hanyu20043
    Hajime Machida17840
    Jaakko Astola15937
    Jon T. Butler45437

    相关期刊

    Unconventional Computing
    International Conference on VLSI Design
    IEEE European Test Symposium
    International Teletraffic Congress
    International Test Conference
    Asia and South Pacific Design Automation Conference
    ACM Journal on Emerging Technologies in Computing Systems
    ACM Transactions on Design Automation of Electronic Systems
    IEEE Circuits and Systems Magazine
    ACM Transactions in Embedded Computing Systems