To send content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about sending content to .
To send content items to your Kindle, first ensure firstname.lastname@example.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about sending to your Kindle.
Note you can select to send to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
It is well known that satisfiability is decidable for Horn clauses of the class . Since arbitrary Horn clauses can naturally be approximated by -clauses, can be used for realizing any program analysis which can be specified by means of Horn clauses. Recently, we have shown that decidability for Horn clauses from is retained if the clauses are either extended with tests for disequality between subterms identified by paths or for disequality between homomorphic images of terms. These two results refer to orthogonal extensions of -clauses. Here, we provide a generalization of both results. For that, we introduce hom-path disequalities and show that for each finite set of -clauses extended with such tests an equivalent tree automaton with hom-path disequalities can be constructed. Since emptiness for that class of automata has been shown decidable by Godoy et al. in 2010, we conclude that satisfiability is decidable for -clauses with hom-path disequalities.
For every fixed-point expression e of alternation-depth r,
we construct a new fixed-point expression e' of alternation-depth 2
. Expression e' is equivalent to e
whenever operators are distributive and the underlying
complete lattice has a co-continuous least upper bound. We
alternation-depth but also w.r.t. the increase in size of the
Email your librarian or administrator to recommend adding this to your organisation's collection.