A Term Rewriting Technique for Decision Graphs | Zendy

Bahareh Badban | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Term Rewriting Technique for Decision Graphs

Author(s) -

Bahareh Badban

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.10.016

Subject(s) - rewriting , term (time) , successor cardinal , representation (politics) , computer science , binary decision diagram , quantifier (linguistics) , constant (computer programming) , mathematics , algorithm , model checking , programming language , transformation (genetics) , theoretical computer science , discrete mathematics , artificial intelligence , mathematical analysis , biochemistry , chemistry , physics , quantum mechanics , politics , political science , law , gene

We provide an automatic verification for a fragment of FOL quantifier-free logic with zero, successor and equality. We use BDD representation of such formulas and to verify them, we first introduce a (complete) term rewrite system to generate an equivalent Ordered (0,S,=)-BDD from any given (0,S,=)-BDD. Having the ordered representation of the BDDs, one can verify the original formula in constant time. Then, to have this transformation automatically, we provide an algorithm which will do the whole process

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research