Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Subtitle: Analyzing and harnessing the potential
Article type: Other
Authors: Järvisalo, Matti
Affiliations: Department Information and Computer Science, Helsinki University of Technology (TKK), Finland
Note: [] Address for corresponcence: Matti Järvisalo, Department of Information and Computer Science, Helsinki University of Technology (TKK), P.O. Box 5400, FI-02015 TKK, Finland. E-mail: matti.jarvisalo@tkk.fi.
Abstract: This note summarizes a dissertation that focuses on methods for solving structured real-world problems based on propositional satisfiability (SAT). The work contributes to the analysis and development of both complete search (DPLL and clause learning) and stochastic local search methods for SAT.
Keywords: Propositional satisfiability, SAT, clause learning, DPLL, stochastic local search, heuristics, proof complexity, problem structure, backdoors, answer set programming
DOI: 10.3233/AIC-2009-0445
Journal: AI Communications, vol. 22, no. 2, pp. 117-119, 2009
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl