We propose an end-to-end approach for answer set programming (ASP) and linear
algebraically compute stable models satisfying given constraints. The idea is to implement …

Linear algebra is an ideal tool to redefine symbolic methods with the goal to achieve better
scalability. In solving the abductive Horn propositional problem, the transpose of a program …

We present a formalization of the Event Calculus (EC) in tensor spaces. The motivation for a
tensorbased predicate calculus comes from the area of composite event recognition (CER) …

Recently it has been demonstrated that deductive and abductive reasoning can be
performed by exploiting the linear algebraic characterization of logic programs. Those …

There have been attempts to connect machine learning and symbolic reasoning, providing
interfaces between them. This work focuses on our original approach to integrate machine …

In logic programming, partial evaluation performs unfolding rules of a program in advance to
reduce the cost of inferencing steps. Recently, partial evaluation of logic programs has been …

Abduction has been applied to various problems in many fields, and computing abductive
explanations is an essential task in such applications. Logic programming has been used for …

Generative AI techniques have attracted much attention, and with the growing use of large-
scale language models (LLMs), interest in symbolic reasoning has increased. In the first half …