University Library
  • Login
A gateway to Melbourne's research publications
Minerva Access is the University's Institutional Repository. It aims to collect, preserve, and showcase the intellectual output of staff and students of the University of Melbourne for a global audience.
View Item 
  • Minerva Access
  • Engineering and Information Technology
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
  • Minerva Access
  • Engineering and Information Technology
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

    Un-kleene boolean equation solving

    Thumbnail
    Citations
    Scopus
    Web of Science
    Altmetric
    1
    1
    Author
    Herlihy, B; Schachte, P; Sondergaard, H
    Date
    2007-04-01
    Source Title
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
    Publisher
    WORLD SCIENTIFIC PUBL CO PTE LTD
    University of Melbourne Author/s
    Schachte, Peter; Sondergaard, Harald; HERLIHY, BRIAN TIMOTHY
    Affiliation
    Computer Science and Software Engineering
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    Herlihy, B., Schachte, P. & Sondergaard, H. (2007). Un-kleene boolean equation solving. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 18 (2), pp.227-250. https://doi.org/10.1142/S0129054107004668.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/29293
    DOI
    10.1142/S0129054107004668
    Abstract
    <jats:p> We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by Kleene iteration: iterative approximation until a fixed point is reached. Conceptually, our new method replaces each k-ary function by 2<jats:sup>k</jats:sup> Boolean constants defined by mutual recursion. The introduction of an exponential number of constants is mitigated by the simplicity of their definitions and by the use of a novel variant of ROBDDs to avoid repeated computation. Experiments suggest that this approach is significantly faster than Kleene iteration for examples that require many Kleene iteration steps. </jats:p>
    Keywords
    Artificial Intelligence and Image Processing

    Export Reference in RIS Format     

    Endnote

    • Click on "Export Reference in RIS Format" and choose "open with... Endnote".

    Refworks

    • Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References


    Collections
    • Minerva Elements Records [53102]
    • Computing and Information Systems - Research Publications [1584]
    Minerva AccessDepositing Your Work (for University of Melbourne Staff and Students)NewsFAQs

    BrowseCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    My AccountLoginRegister
    StatisticsMost Popular ItemsStatistics by CountryMost Popular Authors