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

Checking the soundness of cyclic induction reasoning for first-order logicwith inductive definitions (FOLID) is decidable but the standard checkingmethod is based on an exponential complement operation for B\"uchi automata.Recently, we introduced a polynomial checking method whose most expensive stepsrecall the comparisons done with multiset path orderings. We describe theimplementation of our method in the Cyclist prover. Referred to as E-Cyclist,it successfully checked all the proofs included in the original distribution ofCyclist. Heuristics have been devised to automatically define, from theanalysis of the proof derivations, the trace-based ordering measures thatguarantee the soundness property.

E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning