Unlabelled: Automated reasoning techniques based on computer algebra have seen renewed interest in recent years and are for example heavily used in formal verification of arithmetic circuits. However, the verification process might contain errors. Generating and checking proof certificates is important to increase the trust in automated reasoning tools. For algebraic reasoning, two proof systems, Nullstellensatz and polynomial calculus, are available and are well-known in proof complexity. A Nullstellensatz proof captures whether a polynomial can be represented as a linear combination of a given set of polynomials by providing the co-factors of the linear combination. Proofs in polynomial calculus dynamically capture that a polynomial can be derived from a given set of polynomials using algebraic ideal theory. In this article we present the practical algebraic calculus as an instantiation of the polynomial calculus that can be checked efficiently. We further modify the practical algebraic calculus and gain LPAC (practical algebraic calculus + linear combinations) that includes linear combinations. In this way we are not only able to represent both Nullstellensatz and polynomial calculus proofs, but we are also able to blend both proof formats. Furthermore, we introduce extension rules to simulate essential rewriting techniques required in practice. For efficiency we also make use of indices for existing polynomials and include deletion rules too. We demonstrate the different proof formats on the use case of arithmetic circuit verification and discuss how these proofs can be produced as a by-product in formal verification. We present the proof checkers Pacheck, Pastèque, and Nuss-Checker. Pacheck checks proofs in practical algebraic calculus more efficiently than Pastèque, but the latter is formally verified using the proof assistant Isabelle/HOL. The tool Nuss-Checker is used to check proofs in the Nullstellensatz format.

Supplementary Information: The online version contains supplementary material available at 10.1007/s10703-022-00391-x.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11682020PMC
http://dx.doi.org/10.1007/s10703-022-00391-xDOI Listing

Publication Analysis

Top Keywords

practical algebraic
20
algebraic calculus
20
polynomial calculus
16
calculus
9
checkers pacheck
8
pacheck pastèque
8
pastèque nuss-checker
8
automated reasoning
8
formal verification
8
proof
8

Similar Publications

Superdiffusion is surprisingly easily observed even in systems without the integrability underpinning this phenomenon. Indeed, the classical Heisenberg chain-one of the simplest many-body systems, and firmly believed to be nonintegrable-evinces a long-lived regime of anomalous, superdiffusive spin dynamics at finite temperature. Similarly, superdiffusion persists for long timescales, even at high temperature, for small perturbations around a related integrable model.

View Article and Find Full Text PDF

Unlabelled: Automated reasoning techniques based on computer algebra have seen renewed interest in recent years and are for example heavily used in formal verification of arithmetic circuits. However, the verification process might contain errors. Generating and checking proof certificates is important to increase the trust in automated reasoning tools.

View Article and Find Full Text PDF

Dynamical symmetries, time-dependent operators that almost commute with the Hamiltonian, extend the role of ordinary symmetries. Motivated by progress in quantum technologies, we illustrate a practical algebraic approach to computing such time-dependent operators. Explicitly we expand them as a linear combination of time-independent operators with time-dependent coefficients.

View Article and Find Full Text PDF

This research investigates the dynamics of nonlinear coupled hybrid systems using a modified Mittag-Leffler fractional derivative. The primary objective is to establish criteria for the existence and uniqueness of solutions through the implementation of Dhage's hybrid fixed-point theorem. The study further analyzes the stability of the proposed model.

View Article and Find Full Text PDF

Effective communication is crucial for the performance and collaboration within cooperative networked multi-agent systems. However, existing literature lacks comprehensive solutions for dynamically monitoring and adjusting communication topologies to balance connectivity and energy efficiency. This study addresses this gap by proposing a distributed approach for estimating and controlling system connectivity over time.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!