Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB

📅 2026-08-27
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
本文针对电路图示等价性问题,提出了三个难度递增的基准测试,并使用TPTP和SMT-LIB格式进行了一阶编码,生成了相应的测试实例。
📝 Abstract
We introduce a new family of benchmarks for the problem of diagrammatic equivalence between circuits. Three variants of this problem are considered, ranging from basic to challenging, and benchmarks are generated for each variant. We provide first-order encodings in both TPTP and SMT-LIB formats, together with scripts that automatically generate benchmark instances, and evaluate these benchmarks on state-of-the-art automated theorem provers and SMT solvers.
Problem

Research questions and friction points this paper is trying to address.

diagrammatic equivalence
circuits
benchmarks
Innovation

Methods, ideas, or system contributions that make the work stand out.

new family of benchmarks
diagrammatic equivalence
circuit variants
first-order encodings
automated generation scripts
🔎 Similar Papers
J
Julie Cailler
University of Lorraine, CNRS, INRIA, LORIA, Nancy, France
N
Noé Delorme
University of Lorraine, CNRS, INRIA, LORIA, Nancy, France
S
Sophie Tourret
University of Lorraine, CNRS, INRIA, LORIA, Nancy, France; Max Planck Institute for Informatics, Saarbrücken, Germany