This paper delves into the algebraic properties of Krom logic programs, which are restricted to facts and rules with a single body atom. The research demonstrates that these programs form a monoid under sequential composition, which can be extended to various algebraic structures like seminearrings and quemirings. The study also provides explicit generating sets, canonical decompositions, and characterizes the Kleene star using graph-theoretic concepts, linking logic programming with algebraic automata and graph theory. AI
RANK_REASON Academic paper published on arXiv detailing theoretical computer science research. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →