On Converting Logic Programs Into Matrices

Tuan Quoc, Katsumi Inoue

2023

Abstract

Recently it has been demonstrated that deductive and abductive reasoning can be performed by exploiting the linear algebraic characterization of logic programs. Those experimental results reported so far on both forms of reasoning have proved that the linear algebraic approach can reach higher scalability than symbol manipulations. The main idea behind these proposed algorithms is based on linear algebra matrix multiplication. However, it has not been discussed in detail yet how to generate the matrix representation from a logic program in an efficient way. As conversion time and resulting matrix dimension are important factors that affect algebraic methods, it is worth investigating in standardization and matrix constructing steps. With the goal to strengthen the foundation of linear algebraic computation of logic programs, in this paper, we will clarify these steps and propose an efficient algorithm with empirical verification.

Paper Citation

in Harvard Style

Quoc T. and Inoue K. (2023). On Converting Logic Programs Into Matrices. In Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-623-1, pages 405-415. DOI: 10.5220/0011802400003393

in Bibtex Style

@conference{icaart23,
author={Tuan Quoc and Katsumi Inoue},
title={On Converting Logic Programs Into Matrices},
booktitle={Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2023},
pages={405-415},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011802400003393},
isbn={978-989-758-623-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 15th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - On Converting Logic Programs Into Matrices
SN - 978-989-758-623-1
AU - Quoc T.
AU - Inoue K.
PY - 2023
SP - 405
EP - 415
DO - 10.5220/0011802400003393