Pith. sign in

REVIEW

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.09674 v1 pith:55NRJ5YJ submitted 2024-04-15 cs.DS cs.DBcs.FL

Antoine Amarilli , Marcelo Arenas , YooJung Choi , Mikaël Monet , Guy Van den Broeck , Benjie Wang This is my paper · ORCID
classification cs.DScs.DBcs.FL
keywords circuitsformalismsautomatabooleandecisiondiagramsbinarycircus
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of their variants studied in the setting of knowledge compilation. Last, it explains how these formalisms can be connected to the notions of automata over words and trees.

Discussion (0). Continue with ORCID to comment.

Pith tools