Document Open Access Logo

A Flexible Solver for Finite Arithmetic Circuits

Authors Nathaniel Wesley Filardo, Jason Eisner

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICLP.2012.425.pdf
  • Filesize: 0.59 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • arithmetic circuits
  • memoization
  • view maintenance
  • logic programming

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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.

Cite As Get BibTex

Nathaniel Wesley Filardo and Jason Eisner. A Flexible Solver for Finite Arithmetic Circuits. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 425-438, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/LIPIcs.ICLP.2012.425

Author Details

Nathaniel Wesley Filardo
Jason Eisner
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact