English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Verification methods based on SAT, SMT, and Theorem Proving often rely onproofs of unsatisfiability as a powerful tool to extract information in orderto reduce the overall effort. For example a proof may be traversed to identifya minimal reason that led to unsatisfiability, for computing abstractions, orfor deriving Craig interpolants. In this paper we focus on two importantaspects that concern efficient handling of proofs of unsatisfiability:compression and manipulation. First of all, since the proof size can be verylarge in general (exponential in the size of the input problem), it is indeedbeneficial to adopt techniques to compress it for further processing. Secondly,proofs can be manipulated as a flexible preprocessing step in preparation forinterpolant computation. Both these techniques are implemented in a frameworkthat makes use of local rewriting rules to transform the proofs. We show that acareful use of the rules, combined with existing algorithms, can result in aneffective simplification of the original proofs. We have evaluated severalheuristics on a wide range of unsatisfiable problems deriving from SAT and SMTtest cases.

Resolution Proof Transformation for Compression and Interpolation