2021/09/21 by Luigi Bellomarini, Bellomarini, Luigi, Markus Nissl +3
Computer Science · #Artificial Intelligence (cs.AI) #Databases (cs.DB) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.AI #cs.DB #cs.LO
paper · pdf · doi:10.48550/arxiv.2109.10691
arxiv created 2022/02/16 · arxiv updated 2022/02/17
In this paper, we investigate finite representations of DatalogMTL models. First, we discuss sufficient conditions for detecting programs that have finite models. Then, we study infinite models that eventually become constant and introduce sufficient criteria for programs that allow for such representation. We proceed by considering infinite models that are eventually periodic and show that such representation encompasses all DatalogMTLFP programs, a widely discussed fragment. Finally, we provide a novel algorithm for reasoning over such finite representable programs.