output
20022026
most citedUniversal Quantum Computation with Continuous-Variable Cluster States

897 citations

researchers with a paper here
collaborating institutions
Showing cs.LOShow all

17 papers · 1 filter

cs.LO2026

Probabilistic Abduction in a Fuzzy Logic Framework

Tommaso Flaminio, Katsumi Inoue, Daniil Kozhemiachenko

We study the problem of explaining observations about the probabilities of events, such as "it rains of the time", "rain and snow are equally likely", etc. We explain these…

cs.LO2026

Truth Predicate of Inductive Definitions and Logical Complexity of Infinite-Descent Proofs

Sohei Ito, Makoto Tatsuta

Formal reasoning about inductively defined relations and structures is widely recognized not only for its mathematical interest but also for its importance in computer science, and…

cs.LO2025

Complexity of Abduction in Łukasiewicz Logic

Katsumi Inoue, Daniil Kozhemiachenko

We explore the problem of explaining observations in contexts involving statements with truth degrees such as `the lift is loaded', `the symptoms are severe', etc. To formalise the…

cs.LO2025

Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games

Kittiphon Phalakarn, Yun Chen Tsai, Ichiro Hasuo

For model checking stochastic games (SGs), bounded value iteration (BVI) algorithms have gained attention as efficient approximate methods with rigorous precision guarantees. Howev…

cs.LO2024★ 1 cited

Abductive Reasoning in a Paraconsistent Framework

Meghyn Bienvenu, Katsumi Inoue, Daniil Kozhemiachenko

We explore the problem of explaining observations starting from a classically inconsistent theory by adopting a paraconsistent framework. We consider two expansions of the well-kno…

cs.LO2024★ 2 cited

Braids, twists, trace and duality in combinatory algebras

Masahito Hasegawa, Serge Lechenne

We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented ta…