17 citations · 25 across the 8 of their papers we have counts for
9 papers
How Do LLMs Change Predictions Under Negation?
Jongwook Yoon, Jongwon Lim, Sungjib Lim +2
Negation is an essential feature of human language, yet large language models (LLMs) remain unreliable in processing it. We evaluate recent open-source and closed-source LLMs on ou…
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama +7
A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit sq…
Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers
Tomohiro Sasano, Naoki Nishida, Masahiko Sakai +1
In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences…
Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems
Yutaro Nagae, Masahiko Sakai
A parameterised Boolean equation system (PBES) is a set of equations that defines sets satisfying the equations as the least and/or greatest fixed-points. Thus this system is regar…
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
Ryota Nakayama, Naoki Nishida, Masahiko Sakai
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is a sound structure-preserving transformation for we…
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems
Yutaro Nagae, Masahiko Sakai, Hiroyuki Seki
A parameterised Boolean equation system (PBES) is a set of equations that defines sets as the least and/or greatest fixed-points that satisfy the equations. This system is regarded…
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms
Naoki Nishida, Masahiko Sakai, Yasuhiro Nakano
An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrai…
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short)…
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai +1
Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful meth…