2020/10/20 by Matthew Francis-Landau, Francis-Landau, Matthew, Tim Vieira +3
Computer Science · #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #Semantic Web and Ontologies #Symbolic Computation (cs.SC) #cs.PL #cs.SC
paper · pdf · doi:10.48550/arxiv.2010.10503
An earlier version of this paper appeared at WRLA 2020
arxiv created 2020/10/20 · openalex publication_date 2020/10/20 · arxiv updated 2020/10/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present a scheme for translating logic programs, which may use aggregation and arithmetic, into algebraic expressions that denote bag relations over ground terms of the Herbrand universe. To evaluate queries against these relations, we develop an operational semantics based on term rewriting of the algebraic expressions. This approach can exploit arithmetic identities and recovers a range of useful strategies, including lazy strategies that defer work until it becomes possible or necessary.