School of Computing

Proof of New Decompositional Results for Generalized Symmetries

Neil Kettle and Andy King

Technical Report 05-06, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, August 2006.

Abstract

This note provides proof of some new decompositional results for generalized symmetries in ROBDDs. These results permit generalized symmetries to be found with algorithms that are formulated as a series of passes one for each variable in the ROBDD, which is the basis of the anytime approach to symmetry detection.

Download publication 230 kbytes (PostScript)

Bibtex Record

@techreport{2402,
author = {Neil Kettle and Andy King},
title = {Proof of {N}ew {D}ecompositional {R}esults for {G}eneralized {S}ymmetries},
month = {August},
year = {2006},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2402},
    publication_type = {techreport},
    submission_id = {28695_1154547076},
    number = {05-06},
    address = {University of Kent, Canterbury, Kent, CT2 7NF},
    institution = {University of Kent, Computing Laboratory},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014