2026-07-22T14:19:29Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3642 2024-03-06T10:34:29Z ddc:004 open_access

A Flexible Solver for Finite Arithmetic Circuits Filardo, Nathaniel Wesley Eisner, Jason arithmetic circuits memoization view maintenance logic programming Arithmetic circuits arise in the context of weighted logic programming languages, such as Datalog with aggregation, or Dyna. A weighted logic program defines a generalized arithmetic circuit—the weighted version of a proof forest, with nodes having arbitrary rather than boolean values. In this paper, we focus on finite circuits. We present a flexible algorithm for efficiently querying node values as they change under updates to the circuit's inputs. Unlike traditional algorithms, ours is agnostic about which nodes are tabled (materialized), and can vary smoothly between the traditional strategies of forward and backward chaining. Our algorithm is designed to admit future generalizations, including cyclic and infinite circuits and propagation of delta updates. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nathaniel Wesley Filardo and Jason Eisner 2012 Is Part Of LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2012.425 urn:nbn:de:0030-drops-36420 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.425 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode