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

We address the problem of verifying the satisfiability of Constrained HornClauses (CHCs) based on theories of inductively defined data structures, suchas lists and trees. We propose a transformation technique whose objective isthe removal of these data structures from CHCs, hence reducing theirsatisfiability to a satisfiability problem for CHCs on integers and booleans.We propose a transformation algorithm and identify a class of clauses where italways succeeds. We also consider an extension of that algorithm, whichcombines clause transformation with reasoning on integer constraints. Via anexperimental evaluation we show that our technique greatly improves theeffectiveness of applying the Z3 solver to CHCs. We also show that ourverification technique based on CHC transformation followed by CHC solving, iscompetitive with respect to CHC solvers extended with induction. This paper isunder consideration for acceptance in TPLP.

Solving Horn Clauses on Inductive Data Types Without Induction