Fast Set Bounds Propagation Using a BDD-SAT Hybrid

    Thumbnail
    Citations
    Scopus
    Web of Science
    Altmetric
    11
    4
    Author
    Gange, G; Stuckey, PJ; Lagoon, V
    Date
    2010-01-01
    Source Title
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
    Publisher
    AI ACCESS FOUNDATION
    University of Melbourne Author/s
    Gange, Graeme; Stuckey, Peter; LAGOON, VITALY
    Affiliation
    Computer Science and Software Engineering
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    Gange, G., Stuckey, P. J. & Lagoon, V. (2010). Fast Set Bounds Propagation Using a BDD-SAT Hybrid. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 38, pp.307-338. https://doi.org/10.1613/jair.3014.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/29302
    DOI
    10.1613/jair.3014
    Abstract
    <jats:p>Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques in- cur the significant overhead of constructing and manipulating graphs during search. We present a set-constraint solver which combines BDD-based set-bounds propagators with the learning abilities of a modern SAT solver. Together with a number of improvements beyond the basic algorithm, this solver is highly competitive with existing propagation based set constraint solvers.</jats:p>
    Keywords
    Artificial Intelligence and Image Processing

    Export Reference in RIS Format     

    Collections