The constraint satisfaction problem (CSP) is a potential area of application for anytime methods. In this work we derive anytime curves using a partial constraint satisfaction framework that encompasses problems with complete solutions and those that allow only partial solutions of varying quality. In either case, the curves should converge on optimal solutions with respect to some measure of cost (here, the number of violated constraints). Binary CSPs and k-satisfiability problems were tested, using heuristic repair and branch and bound methods. Curves for heuristic methods either start at a lower level than curves for branch and bound (min-conflicts with binary CSPs) or have a steeper initial descent (GSAT with k-SAT problems). Techniques for randomization such as random walks or restarting with a new random solution appear to be necessary with heuristic procedures for complete convergence to an optimal solution. Branch and bound algorithms are usefully employed in tandem with heuristic methods, especially to verify optimality and, therefore, the quality of solution returned by the latter.
End of preview. The entire article is 4 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/anytime-algorithms-for-constraint-satisfaction-and-sat-problems-p8mgTiVb3B
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Anytime algorithms for constraint satisfaction and SAT problems
Wallace, Richard J.; Freuder, Eugene C.
Follow ACM SIGART Bulletin
, Volume 7 (2)
Association for Computing Machinery – Apr 1, 1996
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
